Quicksort is an efficient sorting algorithm that works based on the divide and conquer approach. It works by selecting a pivot element from the array and then partitioning the remaining elements into two sub-arrays: one containing elements less than the pivot and the other containing elements greater than the pivot. The process is then recursively applied to the sub-arrays. \[\] Correct Option: (b)