Correct Answer - Option 1 : O(nlogn)
Concept
Quick Sort is a Divide and Conquer algorithm. It picks an element as a pivot and partitions the given array.
If pivot element divides the array into two equal half in such a scenario, quick sort takes the least time sort, that is, best case time complexity.
The best case complexity of QuickSort is O(nlogn)
|
Algorithm
|
Best-case (Ω)
|
Average-case (Θ )
|
Worst-case(O)
|
|
Quick sort
|
n×log2n
|
n2
|
n2
|
|
Bubble sort
|
n
|
n2
|
n2
|
|
Insertion sort
|
n
|
n2
|
n2
|
