# Quicksort Multiple choice Questions and Answers (MCQs)

## Click on any option to know the CORRECT ANSWERS

 Question 6
Which is the safest method to choose a pivot element?
 A choosing a random element as pivot B choosing the first element as pivot C choosing the last element as pivot D median-of-three partitioning method

Question 6 Explanation:
This is the safest method to choose the pivot element since it is very unlikely that a random pivot would consistently provide a poor partition.

 Question 7
What is the average running time of a quick sort algorithm?
 A O(N2) B O(N) C O(N log N) D O(log N)

Question 7 Explanation:
The best case and average case analysis of a quick sort algorithm are mathematically found to be O(N log N).

 Question 8
Which of the following sorting algorithms is used along with quick sort to sort the sub arrays?
 A Merge sort B Shell sort C Insertion sort D Bubble sort

Question 8 Explanation:
Insertion sort is used along with quick sort to sort the sub arrays.

It is used only at the end.

 Question 9
Quick sort uses join operation rather than merge operation.
 A true B false

Question 9 Explanation:
Quick sort uses join operation since join is a faster operation than merge.

 Question 10
How many sub arrays does the quick sort algorithm divide the entire array into?
 A one B two C three D four