Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and?
a) There is explicit combine process as well to conquer the solution
b) No work is needed to combine the sub-arrays, the array is already sorted
c) Merging the subarrays
d) None of above
Quick sort is......
a) Stable & in place
b) Not stable but in place
c) Stable but not in place
d) sometime stable & some times in place
One example of in place but not stable algorithm is?
a) Merger Sort
b) Quick Sort
c) Continuation Sort
d) Bubble Sort
In stable sorting algorithm?
a) If duplicate elements remain in the same relative position after sorting
b) One array is used
c) More than one arrays are required
d) Duplicating elements not handled
Continuation/counting sort is suitable to sort the elements in range 1 to k?
a) K is Large
b) K is not known
c) K may be small or large
d) K is small
An in place sorting algorithm is one that uses........arrays for storage.
a) Two dimensional arrays
b) More than one array
c) No Additional Array
d) None of the above
