n) is the best method one can use
> > On Wed, Jun 11, 2008 at 10:03 AM, zee99. 99 <[EMAIL PROTECTED]> wrote:
>
> >> is there any algo that can search a linked list in less than O(n) time
> >> ????
If the list is sorted, you can use binary search with O(log N)
Binomial heap. I don't think it is possible in pure
Binomial heap to get MIN in O(1). The best you can do is O(N), where N
is the number of root nodes.
Tejas Kokje
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Grou
graph. This is a very high level idea. I need
to think more if it can actually work.
Any inputs ?
Tejas Kokje
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, sen
