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

A. T(n) <= 2 T(n/4) + cn

B. T(n) <= T(n/4) + T(3n/4) + cn

C. T(n) <= 2 T(3n/4) + cn

D. T(n) <= T(n/3) + T(3n/4) + cn

A. O(n)

B. O(n²)

C. O(n³)

D. O(2n)

A. O(n)

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

C. O(n²)

D. O(n log n)

A. O(n)

B. O(n log n)

C. O(n²)

D. O(log n)

A. O(n²)

B. O(n)

C. O(n log n)

D. O(1)

A. group sort

B. radix sort

C. bin sort

D. uniform sort

A. O(n)

B. O(n log n)

C. O(n²)

D. O(log n)

A. O(n)

B. O(nlogn)

C. O(n²)

D. O(logn)

A. Merge sort

B. Shell sort

C. Insertion sort

D. Quick sort

A. Faced down

B. Faced up

C. It doesn't matter

D. Both sides are burnt