Answer-Quick sort average time complexity

Question

Accepted Answer

Quick Sort is a divide-and-conquer algorithm that works by selecting a pivot element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. The sub-arrays are then sorted recursively.   ON logN  This is the average time complexity of Quick Sort. The reason is that in an average case, the pivot divides the array into two nearly equal parts, and sorting each part takes OlogN divisions, with each division taking ON time to partition the array.  ON  This represents linear time complexity, which is not the case for Quick Sort.  OlogN  This represents logarithmic time complexity, which does not apply to sorting an array.  ON logNN  This is not a standard time complexity notation for sorting algorithms.  none  This is incorrect because the average time complexity of Quick Sort is well-known to be ON logN.  Hence, the correct answer is  Option 1 ON logN

Quick sort average time complexity

Detailed Solution

More Basics of Computers Questions

Hey! Ask a query

Please Register/Login