the complexity of quicksort is O(nlog n).

Related MCQs

• Quicksort is one of the most common sorting algorithms for sequential computers because of its simplicity, low overhead, and optimal average complexity.
• The performance of quicksort depends critically on the quality of the ______-.
• Quicksort's performance is greatly affected by the way it partitions a sequence.
• Given an array of n elements and p processes, in the message-passing version of the parallel quicksort, each process stores ---------elements of array
• In execution of the hypercube formulation of quicksort for d = 3, split along -----------dimention to partition sequence into two big blocks, one greater than pivot and other smaller than pivot as shown in diagram
• The complexity of bubble sort is Θ(n2).
• Time Complexity of Breadth First Search is? (V – number of vertices, E – number of edges)
• What is the worst case time complexity of a quick sort algorithm?
• What is the average case time complexity of odd-even transposition sort?
• Time Complexity of DFS is? (V – number of vertices, E – number of edges)