BruceLee569 34889fc6d8 Update quick_sort.py (#928)
Use the last element as the first pivot, for it's easy to pop, this saves one element space.
Iterating with the original list saves half the space, instead of generate a new shallow copy list by slice method.
2019-06-28 23:55:31 +08:00
2018-10-20 14:45:08 -05:00
2019-05-16 19:20:42 +08:00
2018-11-12 23:38:08 +05:30
2019-06-16 02:07:23 +05:30
2019-06-22 12:42:28 +08:00
2019-06-26 23:57:08 +08:00
2018-10-19 17:14:25 -05:00
2019-05-26 22:21:22 +05:30
2018-10-30 14:59:46 +01:00
2019-06-28 23:55:31 +08:00
2019-05-26 21:56:10 +05:30
2019-05-26 22:03:53 +05:30
2019-06-02 12:14:18 +08:00
2019-06-02 12:14:18 +08:00

The Algorithms - Python

Donate   Gitter chat   Open in Gitpod

All algorithms implemented in Python (for education)

These implementations are for learning purposes. They may be less efficient than the implementations in the Python standard library.

Contribution Guidelines

Read our Contribution Guidelines before you contribute.

Community Channel

We're on Gitter! Please join us.

Languages
Python 99.9%
Shell 0.1%