The disadvantage of insertion sort is _________.
a) Inefficient to operate with a large list b) Inefficient to operate with a small list c) Both a and b d) None of these
a) Inefficient to operate with a large list b) Inefficient to operate with a small list c) Both a and b d) None of these
a) Selection sort b) Insertion sort c) Quick sort d) None of these
a) Insertion b) Selection c) Quick d) None of these
a) Much more complicated to analyze than that of worst case b) Much more simpler to analyze than that of worst case c) Sometimes more complicated and some other times simpler than that of worst case d) None of these
a) O(n) b) O(n log n) c) O(n2) d) O(n3)
a) Time b) Space c) Both a and b d) None of these
a) Insertion sort b) Quick sort c) Shell sort d) Bubble sort
a) O(n2) b) O(n) c) O(1) d) O(n log n)
a) Binaray sorted tree b) B- tree c) B + tree d) AVL tree
a) Root b) Internal nodes c) Leaves d) All the above
a) Fan-out of a node b) Root c) Tree d) Fan-in of a node
a) Minimum b) Maximum c) May be minimum d) None of these
a) Index pages b) Data pages c) Both a and b d) None of these
a) End nodes b) Terminal nodes c) Final nodes d) Last nodes
a) 4 b) 2 c) 3 d) 5
a) ½ b) 1 c) 2 d) 2/3