Suchalgorithmen

import random
from time import *
list = []
i = 0
while i < 5000:
    i = i + 1
    list.append(random.randint(0, 1000))
def bubblesort(list_unsorted):
    for j in range(len(list_unsorted)):    
#innere Schleife
        for i in range(0, len(list_unsorted)-1 - j):
        #print("j:",j, "i:",i)
            if list_unsorted[i] > list_unsorted[i+1]:
            #Elemente in Liste tauschen
                list_unsorted[i], list_unsorted[i+1] = list_unsorted[i+1], list_unsorted[i]
            #Elemente in List mit temporärer Variable tauschen
            #temp = list_unsorted[i]
            #list_unsorted[i] = list_unsorted[i + 1]
            #list_unsorted[i + 1] = temp
            #print(list_unsorted)

def insertionsort(list_unsorted):
    for i in range(len(list_unsorted) - 1):
        if list_unsorted[i] > list_unsorted[i + 1]:
            while list_unsorted[i] > list_unsorted[i + 1] and i >= 0:
                list_unsorted[i], list_unsorted[i+1] = list_unsorted[i+1], list_unsorted[i]
                i = i-1
        #print(list_unsorted)
def selectionsort(list_unsorted):
    for j in range(len(list_unsorted)):
        min_index = j
        for i in range(j, len(list_unsorted)):
            if list_unsorted[min_index] > list_unsorted[i]:
                min_index = i
        list_unsorted[j], list_unsorted[min_index] = list_unsorted[min_index], list_unsorted[j]
        #print(list_unsorted)
t1 = process_time()
bubblesort(list)
t2 = process_time()
t = t2 - t1
print('Rechenzeit: Bubblesort ', t)
t1 = process_time()
insertionsort(list)
t2 = process_time()
t = t2 - t1
print('Rechenzeit: Insertionsort ', t)

t1 = process_time()
selectionsort(list)
t2 = process_time()
t = t2 - t1
print('Rechenzeit: Selectionsort ', t)