Quick sort in C C++ The popular one Also known as Selection-exchange sort, and Partition-exchange sort Explanation Take first element as pivot and assign it to x. Take two pointers. i and j. i at first element and j at last element. Increment i till a greater element than pivot is obtained and decrement j … Continue reading Quick Sort in C