QUICK-SORT.JS


comparisons:
swaps:



Quicksort works by partitioning an array around a chosen pivot point. Each partition is then treated the same way. This is done recursively until the whole array is sorted.

sort.js
bubble-sort.js optimized-bubble-sort.js selection-sort.js
cocktail-sort.js optimized-cocktail-sort.js
odd-even-sort.js comb-sort.js quick-sort.js
gnome-sort.js optimized-gnome-sort.js
compare sort algorithms