(Solved): The quicksort algorithm works by partitioning a section of the unsorted array into a left part and ...

The quicksort algorithm works by partitioning a section of the unsorted array into a left part and a right part, based on a chosen element within the array called the pivot. What is the runtime complexity of the partition() method used by quicksort()? void quicksort(int[] numbers, int startIndex, int endIndex) // Only attempt to sort the array segment if there are // at least 2 elements if (endIndex e startIndex) return; // Partition the array segment int high = partition(numbers, startIndex, endIndex); // Recursively sort the left segment quicksort(numbers, startIndex, high); // Recursively sort the right segment quicksort(numbers, high $$+1$$, endIndex); $$\mathrm{O}\left({\mathrm{N}}^{?}2\right)$$ O(N) $$\mathrm{O}(\log N)$$ $$\mathrm{O}(\mathrm{N}\log N)$$