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

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

B. T(n) = 2T(2/3n) + O(1)

C. T(n) = 3T(2/3n) + O(n)

D. T(n) = 3T(2/3n) + O(1)

A. 6 4 3 7 11 9 14 12

B. 6 3 4 7 9 14 11 12

C. 7 6 14 11 9 4 3 12

D. 7 6 4 3 9 14 11 12

A. O(n²)

B. O(n log n)

C. O(log n)

D. O(n)

A. Merge sort

B. Cycle sort

C. Counting sort

D. Radix sort

A. O(n)

B. O(n log n)

C. O(n²)

D. O(log n)

A. O(N)

B. O(N log N)

C. O(log N)

D. O(N²)

A. Heap sort

B. Quick sort

C. Selection sort

D. Insertion sort

A. anti-adaptive

B. dependable

C. stable, not in-place

D. stable, adaptive

A. O(n)

B. O(1)

C. O(log n)

D. O(n log n)

A. Ki <= Ki+h for 1<= i*h <= N

B. Kh <= Ki+h for 1<= i <= N

C. Ki <= Kh for 1<= i <= h

D. Ki <= Ki+h for 1<= i <= N-h