What is the average number of comparisons used to heap sort...

Home / Data Structure / Sorting Algorithms / Question

Examveda

What is the average number of comparisons used to heap sort a random permutation of N distinct items?

A. 2N log N-O(N)

B. 2N log N-O(N log N)

C. 2N log N-O(N log log N)

D. 2N log N-O(log N)

Answer: Option C

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