Vidyalelo
Data Structure · Q407

Sorting Algorithms

Programming · Data Structure · question 407

Q407

Why is Shell sort called as a generalization of Insertion sort?

A.
Shell sort allows an exchange of far items whereas insertion sort moves elements by one position
Answer
B.
Improved lower bound analysis
C.
Insertion is more efficient than any other algorithms
D.
Shell sort performs internal sorting

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board