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

A. True

B. False

A. O(n)

B. O(1)

C. O(n log n)

D. O(n²)

A. pigeonhole sort is a comparison based sort

B. any comparison based sorting can be made stable

C. quick sort is not a comparison based sort

D. any comparison based sort requires at least O(n²) time

A. O(n log n)

B. O(n²)

C. O(n² log n)

D. O(n log n²)

A. merge sort

B. quick sort

C. heap sort

D. insertion sort

A. O(n)

B. O(1)

C. O(log n)

D. O(n log n)

A. O(n)

B. O(log n)

C. O(1)

D. O(n²)

A. O(n)

B. O(n log n)

C. O(n²)

D. O(log n)

A. it is a comparison based sort

B. it is an adaptive algorithm

C. it is not an in place algorithm

D. it is stable algorithm

A. O(nlogn)

B. O(logn)

C. O(n)

D. O(n²)