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

A. intro sort

B. quick sort

C. tim sort

D. merge sort

A. O(N)

B. O(N²)

C. O(N^1/2)

D. O(N^3/2)

A. 8

B. 7

C. 9

D. 6

A. binary insertion sort

B. merge sort

C. heap sort

D. selection sort

A. counting sort is a comparison based sort

B. any comparison based sorting can be made stable

C. bubble sort is not a comparison based sort

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

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(n)

D. O(n²/2^a) (a=number of increment)

A. True

B. False

A. True

B. False

A. O(N)

B. O(N²)

C. O(N^1/2)

D. O(N^3/2)