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

A. True

B. False

A. O(n)

B. O(n²)

C. O(n log n)

D. O(log n)

A. O(n log n)

B. O(n²)

C. O(n² log n)

D. O(n log n²)

A. selection sort

B. quick sort

C. insertion sort

D. heap sort

A. greedy algorithm

B. divide and conquer algorithm

C. dynamic programming algorithm

D. backtracking algorithm

A. O(n + k)

B. O(n.k)

C. O(n²)

D. O(n log n)

A. 3,3

B. 4,4

C. 3,4

D. 4,3

A. Single loop

B. 2 nested loops

C. 3 nested loops

D. It does not require any loop

A. high memory overhead for small data

B. high memory overhead for any data

C. balancing is slow

D. Iteration is slow

A. stupid sort

B. bogo sort

C. donkey sort

D. monkey sort