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

A. True

B. False

A. true

B. false

A. O(log n)

B. O(n log n)

C. O(n²)

D. O(n² log n)

A. any ordinary tree

B. balanced tree

C. binary search tree

D. unbalanced tree

A. N log N-O(N)

B. O(N log N)-O(N)

C. O(N log N)-1

D. 2N log N + O(N)

A. O(n²)

B. O(n)

C. O(n log n)

D. O(1)

A. 5 and 4

B. 4 and 5

C. 2 and 4

D. 2 and 5

A. increasing sorting order

B. tree preorder

C. tree inorder

D. decreasing sorting order

A. true

B. false

A. it has a low space complexity

B. it has good time complexity for balanced BST

C. it is an online sorting algorithm

D. it is stable sorting algorithm