Quicksort in Python
suggest changedef quicksort(arr): if len(arr) <= 1: return arr pivot = arr[len(arr) / 2] left = [x for x in arr if x < pivot] middle = [x for x in arr if x == pivot] right = [x for x in arr if x > pivot] return quicksort(left) + middle + quicksort(right) print quicksort([3,6,8,10,1,2,1])
Prints “[1, 1, 2, 3, 6, 8, 10]”
Found a mistake? Have a question or improvement idea?
Let me know.
Table Of Contents