23 lines
625 B
Python
23 lines
625 B
Python
import random
|
|
import time
|
|
n = 50000
|
|
Array = [random.randint(1, n) for _ in range(1, n)]
|
|
print("Unsortiertes Array A:", Array)
|
|
Länge = len(Array)
|
|
|
|
def selection_sort():
|
|
for i in range(Länge):
|
|
min_index = i
|
|
for j in range(i+1, Länge):
|
|
if Array[j] < Array[min_index]:
|
|
min_index = j
|
|
if min_index != i:
|
|
Array[i], Array[min_index] = Array[min_index], Array[i]
|
|
|
|
print("Sortiert sieht das Array A so aus:", Array)
|
|
|
|
start = time.time()
|
|
selection_sort()
|
|
end = time.time()
|
|
verstrichene_zeit = end - start
|
|
print(f'Ausführungszeit: {verstrichene_zeit} Sekunden') |