# Shell Sort Multiple choice Questions and Answers (MCQs)

## Shell Sort Multiple choice Questions and Answers (MCQs)

 Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
What is the other name for a shell sort algorithm?
 A Diminishing increment sort B Diminishing decrement sort C Insertion sort D Selection sort
Question 1 Explanation:
The other name for a shell sort algorithm is diminishing decrement sort as the distance between comparisons decreases as the algorithm runs until the last phase.

 Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
The worst case running time of shell sort, using Shell's increments is?
 A O(N) B O(N log N) C O(log N) D O(N2)
Question 2 Explanation:
The lower bound of a shell sort algorithm is mathematically found to be O(N2).

 Question 3 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Who invented the shell sort algorithm?
 A John Von Neumann B Donald Shell C Tony Hoare D Alan Shell
Question 3 Explanation:
Shell sort algorithm is invented by Donald shell. Merge sort is invented by John Von Neumann. Quick sort is invented by Tony Hoare.

 Question 4 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Shell sort algorithm is the first algorithm to break the quadratic time barrier.
 A True B False
Question 4 Explanation:
Shell sort broke the quadratic time barrier as it works by comparing elements that are distant.

 Question 5 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Shell sort algorithm is an example of?
 A External sorting B Internal sorting C In-place sorting D Bottom-up sorting
Question 5 Explanation:
Shell sort is an example of internal sorting because sorting of elements is done internally using an array.

There are 5 questions to complete.