QuickSort Algorithm

Overview

QuickSort is an efficient, in-place sorting algorithm that uses the divide and conquer approach to sort items.

• Select a pivot element from the array.
• Partition the array into sub-arrays around the pivot.
• Recursively sort the sub-arrays.

Visual Representation