In counting sort, once we know the ranks, we simply.......numbers to their final positions in an output array.
a) Delete
b) Copy
c) Mark
d) arrange
Merge sort is stable sort, but not an in-place algorithm?
a) True
b) False
c) NA
d) N/A
It is possible to sort without making comparisons?
a) True
b) False
c) NA
d) AN
In Quick Sort Constants hidden in T(n log n) are?
a) Large
b) Medium
c) Small
d) Not Known
The running time of quick sort depends heavily on the selection of?
a) No of inputs
b) Arrangement of elements in array
c) Size of elements
d) Pivot element
After partitioning array in Quick sort, pivot is placed in a
position such that?
a) Values smaller than pivot are on left and larger than pivot are on right
b) Values larger than pivot are on left and smaller than pivot are on right (C)
Pivot is the first element of array
c) Pivot is the last element of array
