Sorting Algorithms - Study Mode
[#111] The worst case running time of shell sort, using Shell's increments is?
Correct Answer
(D) O(N 2 )
[#112] Which of the following sorting algorithms can be considered as improvement to the binary tree sort?
Correct Answer
(A) Heap sort
[#113] Which of the following options contain the correct feature of an insertion sort algorithm?
Correct Answer
(D) stable, adaptive
[#114] What is the auxiliary space requirement of cycle sort?
Correct Answer
(B) O(1)
[#115] Records R1, R2, R3,.. RN with keys K1, K2, K3,.. KN are said to be h-ordered, if . . . . . . . .
Correct Answer
(D) Ki <= Ki+h for 1<= i <= N-h