# Quicksort Multiple choice Questions and Answers (MCQs)

## Quicksort Multiple choice Questions and Answers (MCQs)

Congratulations - you have completed Quicksort Multiple choice Questions and Answers (MCQs).

You scored %%SCORE%% out of %%TOTAL%%.

Your performance has been rated as %%RATING%%

 Question 1 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
Which of the following sorting algorithms is the fastest?
 A Merge sort B Quick sort C Insertion sort D Shell sort
Question 1 Explanation:
Quick sort is the fastest known sorting algorithm because of its highly optimized inner loop.

 Question 2 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
Quick sort follows Divide-and-Conquer strategy.
 A True B False
Question 2 Explanation:
In quick sort, the array is divided into sub-arrays and then it is sorted (divide-and-conquer strategy).

 Question 3 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
What is the worst case time complexity of a quick sort algorithm?
 A O(N) B O(N log N) C O(N2) D O(log N)
Question 3 Explanation:
The worst case performance of a quick sort algorithm is mathematically found to be O(N2).

 Question 4 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
Which of the following methods is the most effective for picking the pivot element?
 A first element B last element C median-of-three partitioning D random element
Question 4 Explanation:
Median-of-three partitioning is the best method for choosing an appropriate pivot element. Picking a first, last or random element as a pivot is not much effective.

 Question 5 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
Find the pivot element from the given input using median-of-three partitioning method.

8, 1, 4, 9, 6, 3, 5, 2, 7, 0.

 A 8 B 7 C 9 D 6