tiggerskc

Member
Dec 19, 2001
27
0
0
hey guys..
i have a question about Heaps:

i have a heap class.. the add function adds elements into a heap.
n elements would take O(n log n) by simply calling add n times.

is there a faster way to build the heap?

thanks
-steve