Sortieralgorithmen Visualisierung

for i in range(len):
    for j in range(len-1-i):
        if array[j] > array[j + 1]:
            swap(array[j], array[j + 1])
            
            

def quickSort(array, low, high): 
    if low < high:
        pivot = Partition(array, low, high)
        quickSort(array, low, pivot - 1)
        quickSort(array, pivot + 1, high)
        

for i in range(len):
    minIndex = i;
    for j in range(i+1,len):
        if array[j] < array[minIndex]:
            minIndex = j;
    swap(array[i], array[minIndex]);