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

A. gravity sort

B. strand sort

C. abacus sort

D. counting sort

A. O(nlogn)

B. O(logn)

C. O(n)

D. O(n²)

A. bubble sort

B. counting sort

C. radix sort

D. bucket sort

A. insertion sort

B. quick sort

C. tree sort

D. gnome sort

A. Binary heap

B. Quick sort

C. Merge sort

D. Radix sort

A. Quick sort

B. Cocktail sort

C. Bubble sort

D. Merge sort

A. quick sort

B. heap sort

C. bead sort

D. strand sort

A. when no. of elements are less than 64

B. when no. of elements are greater than 64

C. when no. of elements are less than size of run

D. when no. of elements are less than 32

A. Non Polynomial time

B. Non-deterministic Probabilistic

C. Non-deterministic Polynomial time

D. Non Probabilistic time

A. quick sort

B. insertion sort

C. counting sort

D. gnome sort