mirror of
https://github.com/kamranahmedse/developer-roadmap.git
synced 2026-10-25 09:34:00 +08:00
* refactor: clean to roadmap content * refactor: move shared helpers into scripts/lib
703 B
703 B
Quick Sort
Quick Sort is a divide and conquer algorithm. It picks an element as pivot and partitions the given array around the picked pivot. There are many different versions of quickSort that pick pivot in different ways.
Visit the following resources to learn more: