| 1 | |
| 2 | def quicksort(l): |
| 3 | if len(l) <= 1: |
| 4 | return l |
| 5 | pivot = l[len(l) // 2] |
| 6 | left = [x for x in l if x < pivot] |
| 7 | middle = [x for x in l if x == pivot] |
| 8 | right = [x for x in l if x > pivot] |
| 9 | return quicksort(left) + middle + quicksort(right) |
| 10 | |
| 11 | print(quicksort([3,6,8,10,1,2,1])) |
huncholane