". VdoTips

APPLY LATEST GOVT JOBS

hi
186. In abstract terms, each iteration of insertion sort removes an element from the input data and then inserts it into the correct position in the _________ that is already sorted.
(A).List
(B).Stack
(C).String
(D).Array


187. An array sorted in the reverse order is the __________ case input.
(A).Worst
(B).Best
(C).Somewhat bad
(D).None of the above


188.___________ is a simple sorting technique to sort a list of elements.
(A).Insertion sort
(B).Selection sort
(C).Sorting array
(D).None of the above


189. The running time of heap sort is __________.
(A).G(N*lgN)
(B).N(N*lgN)
(C).O(N*lgN)
(D).None of the above


190. There is one to one correspondence between elements of the _________of the tree.
(A).Array and trees
(B).Array and nodes
(C).Arrays and nodes
(D).None of the above