# YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS

## 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?

Diminishing increment sort | |

Diminishing decrement sort | |

Insertion sort | |

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?

O(N) | |

O(N log N) | |

O(log N) | |

O(N ^{2}) |

Question 2 Explanation:

The lower bound of a shell sort algorithm is mathematically found to be O(N

^{2}).Question 3 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Who invented the shell sort algorithm?

John Von Neumann | |

Donald Shell | |

Tony Hoare | |

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.

True | |

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?

External sorting | |

Internal sorting | |

In-place sorting | |

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.