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

A. O(N)

B. O(N log N)

C. O(log N)

D. O(N²)

A. O(nlogn)

B. O(logn)

C. O(n)

D. O(n²)

A. intro sort

B. merge sort

C. counting sort

D. radix sort

A. O(nlogn)

B. O(n²logn)

C. O(n²)

D. O(n³)

A. O(n)

B. O(n log n)

C. O(n²)

D. O(n² log n)

A. It is a non comparison based integer sort

B. It is a comparison based integer sort

C. It is a non comparison based non integer sort

D. It is a comparison based non integer sort

A. O(1)

B. O(n)

C. O(log n)

D. O(n log n)

A. Quick sort

B. Bubble sort

C. Selection sort

D. No sorting algorithm is preferred

A. O(n)

B. O(n log n)

C. O(n²)

D. O(log n)

A. LSD radix sort is an integer sorting algorithm

B. LSD radix sort is a comparison sorting algorithm

C. LSD radix sort is a distribution sort

D. LSD radix sort uses bucket sort