What is the advantage of pigeonhole sort over merge sort

Home / Data Structure / Sorting Algorithms / Question

Examveda

What is the advantage of pigeonhole sort over merge sort?

A. pigeonhole sort has lesser time complexity when range is comparable to number of input elements

B. pigeonhole sort has lesser space complexity

C. counting sort is not a comparison based sorting technique

D. pigeonhole sort is adaptive

Answer: Option A

This Question Belongs to Data Structure >> Sorting Algorithms

Related Questions on Sorting Algorithms

A. O(n log n)

B. O(n)

C. O(n²)

D. O(n³)

View Answer

A. Insertion Sort

B. Quick Sort

C. Selection Sort

D. Insertion Sort

View Answer

A. O(n²)

B. O(1)

C. O(n)

D. O(log n)

View Answer

A. Merge Sort

B. Heap Sort

C. Counting Sort

D. Quick Sort

View Answer