(A, low, high)
| 1 | # anupkafle |
| 2 | |
| 3 | def partition(A, low, high): |
| 4 | pivot = A[low] |
| 5 | i = low + 1 |
| 6 | j = high |
| 7 | while True: |
| 8 | while i <= j and A[i] <= pivot: |
| 9 | i = i + 1 |
| 10 | while i <=j and A[j] > pivot: |
| 11 | j = j - 1 |
| 12 | if i <= j: |
| 13 | A[i], A[j] = A[j], A[i] |
| 14 | else: |
| 15 | break |
| 16 | A[low], A[j] = A[j], A[low] |
| 17 | return j |
| 18 | |
| 19 | |
| 20 | def quicksort(A, low, high): |