|
| 1 | +# QuickSort - Pythonic |
| 2 | +def quicksort(arr): |
| 3 | + if len(arr) <= 1: |
| 4 | + return arr |
| 5 | + pivot = arr[len(arr) // 2] |
| 6 | + left = [x for x in arr if x < pivot] |
| 7 | + middle = [x for x in arr if x == pivot] |
| 8 | + right = [x for x in arr if x > pivot] |
| 9 | + return quicksort(left) + middle + quicksort(right) |
| 10 | + |
| 11 | +#print(quicksort([3,6,8,10,1,2,1])) |
| 12 | + |
| 13 | + |
| 14 | +# QuickSort - Normal |
| 15 | +def partition(start, end, arr): |
| 16 | + """Returns the partition index.""" |
| 17 | + # Last element chosen as Pivot |
| 18 | + pivot = arr[end] |
| 19 | + p_index = start |
| 20 | + for i in range(start, end): #Places pivot in correct position |
| 21 | + if arr[i] <= pivot: |
| 22 | + # Swap arr[i] with arr[p_index] |
| 23 | + arr[i], arr[p_index] = arr[p_index], arr[i] |
| 24 | + p_index += 1 |
| 25 | + |
| 26 | + # Swapping the pivot element with element at p_index |
| 27 | + arr[p_index], arr[end] = arr[end], arr[p_index] |
| 28 | + return p_index |
| 29 | + |
| 30 | + |
| 31 | +def quicksort(start, end, arr): |
| 32 | + if start < end: |
| 33 | + p_index = partition(start, end, arr) |
| 34 | + quicksort(start, p_index-1, arr) |
| 35 | + quicksort(p_index+1, end, arr) |
| 36 | + |
| 37 | + |
| 38 | +arr = [1,5,-9,6,-66,-70,2,45] |
| 39 | +quicksort(0,len(arr)-1,arr) |
| 40 | +print(arr) |
| 41 | + |
0 commit comments