You are viewing a single comment's thread. Return to all comments →
Here is my Python solution.
def quickSort(arr): pivot = arr[0] arr.remove(pivot) array = [pivot] for num in arr: if num <= pivot: array.insert(array.index(pivot), num) else: array.append(num) return array
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 →
Here is my Python solution.