Great!
Since we're dealing with a stack here your assertion
is that find_min doesn't change until the current
min is popped of the stack.
However,
Balaji Gopalan wrote:
>the extension of this prob asks whether one more function extract_min()
>(which returns and deletes the current minimum ) can be  implemented in O(1)
>time.
> [hint: it cant be...y?]

Pls do elaborate on the "why".


--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---

Reply via email to