We chatted.. if each insert costs log n, and you are doing it n times.. you get n log n, no? If you heapify an existing array, you get n... which isn't much better anyway. At least TCRC likes to claim that max and min ops are done in n time, which seems right, no?
---- Then B.I. said, "Hov' remind yourself
nobody built like you, you designed yourself"
Comment on Re^5: getting the highest value in a simpler way