Question

What is the importance of pivot element in quicksort?

Answer 1

Explanation:

✍✍✍✍✍Problem: Given a sorted integer array which is rotated any number of times, find the pivot index i.e. index of the minimum element of the array.

✍✍✍✍✍(c) If array[start] less than or equal to array[mid], it means from start to mid, all elements are in sorted order.

Answer 2

${ \huge {\boxed {\boxed {\star\: \red{Answer}\: \star}}}}$

The quicksort algorithm is a sorting algorithm that sorts a collection by choosing a pivot point, and partitioning the collection around the pivot, so that elements smaller than the pivot are before it, and elements larger than the pivot are after it