QuickSort 🔥
123456789101112
def quicksort(arr,low,high):
if low >= high:
return
pivot = arr[low]
i = low+1
for j in range(low+1,high+1):
if pivot > arr[j]:
arr[i],arr[j] = arr[j],arr[i]
i = i + 1
arr[low],arr[i-1] = arr[i-1],arr[low]
quicksort(arr,0,i-1)
quicksort(arr,i,high)
Python
INFO