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

A. Fibonacci heap

B. Binary tree

C. Priority queue

D. FIFO

A. in-place algorithm

B. pivot position can be changed

C. adaptive sorting algorithm

D. can be implemented as a stable sort

A. O(n)

B. O(n log n)

C. O(n²)

D. O(log n)

A. it has better time complexity

B. it has better space complexity

C. it is easy to implement

D. it has no significant advantage

A. Statement I is true but Statement II is false

B. Both Statement I and Statement II are false

C. Both Statement I and Statement II are true

D. Statement II is true but Statement I is false

A. O(n)

B. O(n log n)

C. O(n²)

D. O(log n)

A. The leftmost element is chosen as the pivot

B. The rightmost element is chosen as the pivot

C. Any element in the array is chosen as the pivot

D. A random number is generated which is used as the pivot

A. Bubble Sort

B. Quick Sort

C. Partition-exchange Sort

D. Insertion Sort

A. true

B. false

A. true

B. false