sure, but the implementation is confusing. My question is does not the 2nd count overwrite the 1st value of count in side the function?
Thank you. On Sun, Aug 22, 2010 at 1:04 AM, Harshal ..Bet oN iT!! <[email protected]>wrote: > if it is a min heap,, then traversing down from the root node, it takes > O(k) time to reach the kth smallest element. so, i think its just that > straight!!! plz correct me if m wrong??? > > -- > 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]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- 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.
