What is the average number of comparisons used in a heap sort algorith

1.	What is the average number of comparisons used in a heap sort algorithm?
A.	N log N-O(N)
B.	O(N log N)-O(N)
C.	O(N log N)-1
D.	2N log N + O(N)
Answer» E.

Discussion