You are viewing a single comment's thread. Return to all comments →
python
def quickSort(arr): p=arr[0] min_result=[] max_result=[] result=[] for i in arr: if i<p: result.append(i) elif i>p: max_result.append(i) result.extend(min_result) result.append(p) result.extend(max_result) return result
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