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

A.

if(n < 1)
return;

B.

if(n == 0)
return;

C.

if(n <= 1)
return;

D.

If(n == 2)
return;

A. O(n)

B. O(1)

C. O(max(input))

D. O(log n)

A. O(nlogn)

B. O(logn)

C. O(n)

D. O(n²)

A. O(n)

B. O(n²)

C. O(n log n)

D. O(log n)

A. Bubble sort

B. Insertion sort

C. Merge sort

D. Quick sort

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. True

B. False

A. Heap sort

B. Smooth sort

C. Quick sort

D. LSD radix sort

A. quick sort

B. insertion sort

C. heap sort

D. merge sort

A. O(N²)

B. O(N^3/2)

C. O(N^4/3)

D. O(N^5/4)