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

..

Bitonic_Sort.py

…

bogo_sort.py

…

bubble_sort.py

…

bucket_sort.py

…

cocktail_shaker_sort.py

…

comb_sort.py

…

counting_sort.py

…

cycle_sort.py

…

external_sort.py

…

gnome_sort.py

…

heap_sort.py

…

insertion_sort.py

…

merge_sort_fastest.py

…

merge_sort.py

…

normal_distribution_quick_sort.md

…

Odd-Even_transposition_parallel.py

…

Odd-Even_transposition_single-threaded.py

…

pancake_sort.py

…

pigeon_sort.py

…

quick_sort_3_partition.py

…

quick_sort.py

Update quick_sort.py (#928)

2019-06-28 23:55:31 +08:00

radix_sort.py

…

random_normal_distribution_quicksort.py

…

random_pivot_quick_sort.py

…

selection_sort.py

…

shell_sort.py

…

sorting_graphs.png

…

tests.py

…

tim_sort.py

…

topological_sort.py

…

tree_sort.py

…

wiggle_sort.py

…