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:

• Quick Sort Algorithm
• Quick Sort Algorithm - Geeks for Geeks
• Quick Sort in 4 Minutes
• Quick Sort Implementaiton in C
• Quick Sort Implementation in Python