Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import random
- def QuickSort(A, l, r):
- if l >= r:
- return
- else:
- q = random.choice(A[l:r])
- i = l
- j = r
- while i <= j:
- while A[i] < q:
- i += 1
- while A[j] > q:
- j -= 1
- if i <= j:
- if i < j:
- A[i], A[j] = A[j], A[i]
- i += 1
- j -= 1
- QuickSort(A, l, j)
- QuickSort(A, i, r)
- return lst
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement