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

A. O(n)

B. O(nlogn)

C. O(n²)

D. O(logn)

A. Library sort has a better average time complexity

B. Library sort has a better space complexity

C. Library sort has better best case time complexity

D. Library has better worst case time complexity

A. O(nlogn)

B. O(logn)

C. O(n)

D. O(n²)

A. O(1)

B. O(n)

C. O(log n)

D. O(n log n)

A. O(n)

B. O(n log n)

C. O(n²)

D. O(log n)

A. one

B. two

C. three

D. four

A. radix sort performs better than quick sort when we have log n bits for every digit

B. radix sort has lesser space complexity

C. radix sort is not a comparison based sorting technique

D. radix sort has better cache performance than quick sort

A. True

B. False

A. when input array is already sorted

B. when input array is reverse sorted

C. when input array is large

D. when input array is has randomly spread elements

A. O(n²)

B. O(n)

C. O(n log n)

D. O(1)