from datetime import datetime
items = [4, 1, 5, 3, 2]
# Time Complexity from O(n log(n)) to O(n^2)
# Space Complexity O(log(n))
def quick_sort(data):
def sort(s_data, fst, lst):
if fst >= lst:
return
i, j = fst, lst
x = s_data[(fst + lst) // 2]
while i <= j:
while s_data[i] < x:
i += 1
while s_data[j] > x:
j -= 1
if i <= j:
s_data[i], s_data[j] = s_data[j], s_data[i]
i, j = i + 1, j - 1
sort(s_data, fst, j)
sort(s_data, i, lst)
return s_data
return sort(list(data), 0, len(data) - 1)
sort_items = quick_sort(items)
# sort_items is [1, 2, 3, 4, 5]
print(items)
print(sort_items)
# *** simplified speed test ***
items = list(range(1, 200))
items[5], items[6] = items[6], items[5]
count = 1000
start = datetime.now()
for n in range(1, count):
quick_sort(items)
delta = datetime.now() - start
total_microseconds = delta.seconds*1000000 + delta.microseconds
print(total_microseconds)
# about 412_947 microseconds