What is the best case complexity of QuickSort?
a) O(nlogn) b) O(logn) c) O(n) d) O(n2)
For merging two sorted lists of size m and n into sorted list of size m+n, we require comparisons of
a) O(m) b) O(n) c) O(m+n) d) O(logm + logn)
What is the advantage of bubble sort over other sorting techniques?
a) It is faster b) Consumes less memory c) Detects whether the input is already sorted d) All of the mentioned
The best case for the recursion are sub problems of size _____.
a) 0 or 1 b) 2 or 3 c) 4 or 5 d) 6 or 7
_______ is a sorting algorithm based on the divide-and-conquer paradigm.
a) Shell sort b) Heap sort c) Merge-sort d) Quick sort
Merge sort has _______ running time
a) log n b) O(log n) c) n logn d) O(n log n)
_______ is a method of algorithm design.
a) Divide and conquer b) Recur c) Decrease and conquer d) Conque
First implementation of merge sort was on the ENIAC in the year _______.
a) 1942 b) 1949 c) 1945 d) 1944
Radix and bucket sorts are ______.
a) Partially stable b) Unstable c) Equal d) Stable
Radix-sort perform the bucket sorts by ______.
a) Least significant digits b) Most significant digits c) Least common digits d) Most common digits
Radix sort is ____ of bucket sort.
a) Weighted graph b) Generalization c) Serialization d) Normalization
______ works as long as the Bucket sort stages are stable sorts.
a) Sorting b) Radix sort c) Bucket sort d) Bubble sort
Radix and ______ do not work well when keys are very long.
a) Non-linear sort b) List c) Bucket sort d) Set
Sorting algorithm can be characterized as ______.
a) Simple algorithm which require the order of n2 comparisons to sort n items. b) Sophisticated algorithm that require the O(n log 2n) comparisons to sort items c) Both of the above d) None of the above
______ is a specialization of lexicographic-sort that uses bucket-sort as the stable sorting algorithm.
a) Heap sort b) Bubble sort c) Linear sort d) Radix-sort
If we were sorting entries according to keys, then each bucket is a _______.
a) Heap b) Stack c) Queue d) Buffer area