+**Quick Sort** is an efficient [sorting algorithm](/wiki/sorting_algorithm) that follows a [divide and conquer](/wiki/divide_and_conquer) paradigm. It works by picking an element as a pivot and partitioning the array around it, then recursively sorting the sub-arrays.
+## See also
+- [Merge Sort](/wiki/merge_sort)
+- [Bubble Sort](/wiki/bubble_sort)
+- [Algorithm](/wiki/algorithm)
... 1 more lines