@Praveen: No. Brijesh was correct. Inserting an element into a heap with k elements is O(log k). This must be done n times, so O(n log k).
Dave On Sep 8, 12:50 pm, praveen raj <[email protected]> wrote: > @brijesh...Tht would...be... O(klogn).... -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
