Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import doctest
- def quickSort(lista):
- """
- >>> quickSort([2, 3, 1, 4, 5, 7, 8])
- [1, 2, 3, 4, 5, 7, 8]
- >>> quickSort([9,7,4,8,2,1,6,3,54,2,6,1,21,76,3,7])
- [1, 1, 2, 2, 3, 3, 4, 6, 6, 7, 7, 8, 9, 21, 54, 76]
- """
- if len(lista) <= 1:
- return lista
- pivo = lista[-1] # Ultimo elemento da lista
- p, q = [], []
- # Itera sobre a lista, exceto o ultimo elemento (pivo)
- for elem in lista[:-1]:
- if elem < pivo:
- p.append(elem)
- else:
- q.append(elem)
- return quickSort(p) + [pivo] + quickSort(q)
- doctest.testmod()
Add Comment
Please, Sign In to add comment