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

A. when implemented with an unbalanced tree

B. when implemented with a balanced tree

C. when implemented with a splay tree as BST

D. when implemented with AVL tree as BST

A. O(n + max(input))

B. O(n²)

C. O(n log n + max(input))

D. O(n log n)

A. O(n)

B. O(n log n)

C. O(n²)

D. O(log n)

A. diminishing decrement sort

B. diminishing increment sort

C. partition exchange sort

D. diminishing insertion sort

A. when range of input is less than number of elements

B. when range of input is more than number of elements

C. when range of input is comparable to the number of elements

D. when the given array is almost sorted

A. true

B. false

A. Heap Sort

B. Quick Sort

C. Insertion Sort

D. Merge Sort

A. 5

B. 6

C. 7

D. 8

A. It requires auxiliary memory

B. It is not scalable

C. It can be used for small keys

D. It takes linear time to sort the elements

A. Merging

B. Partitioning

C. Selection

D. Exchanging