You are viewing a single comment's thread. Return to all comments →
Python
def quickSort(arr): center = arr[0] arr = sorted(arr) l = [center] for value in arr: if value < center: l.insert(0,value) elif value > center : l.insert(arr.index(value),value) return l
Seems like cookies are disabled on this browser, please enable them to open this website
Quicksort 1 - Partition
You are viewing a single comment's thread. Return to all comments →
Python