Przejdź do treści

Sortowanie wolne

Opis problemu

Implementacja

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
def slow_sort(array: list, start_index: int, end_index: int):
    if start_index >= end_index:
        return

    middle_index = (start_index + end_index) // 2
    slow_sort(array, start_index, middle_index)
    slow_sort(array, middle_index + 1, end_index)
    if array[end_index] < array[middle_index]:
        array[middle_index], array[end_index] = array[end_index], array[middle_index]

    slow_sort(array, start_index, end_index - 1)

array = [7, 3, 0, 1, 5, 2, 5, 19, 10, 5]

slow_sort(array, 0, len(array) - 1)

print(array)