Sorting Algorithms MCQ question and answer with solution | Data Structure MCQs

A. LSD radix sort

B. Pigeonhole sort

C. Counting sort

D. MSD radix sort

A. O(n)

B. O(n log n)

C. O(n²)

D. O(log n)

A. T(n) = 2T(n/2) + n

B. T(n) = 2T(n/2) + c

C. T(n) = T(n-1) + n

D. T(n) = T(n-1) + c

A. quick sort

B. strand sort

C. cycle sort

D. heap sort

A. selection sort

B. quicksort

C. insertion sort

D. heap sort

A. 4

B. 5

C. 6

D. 3

A. O(1)

B. O(n)

C. O(log n)

D. O(n+k) k=range of input

A. is equal to number of elements in the array

B. is equal to 1.3

C. depends on the number of iterations

D. depends on the compiler being used

A. 8

B. 2

C. 4

D. 9

A. O(1)

B. O(n/2)

C. O(logn/log(logn))

D. O(logn)