[algogeeks] Re: DataStructure - Push,Pop & Find_Min in O(1)

[Mohammad Moghimi]

I think in this way we can sort in O(n), but I cannot construct a sort algorithm using (push-pop-findmin) so far! have you been found that?

On 3/26/06, Vijay Venkat Raghavan N <[EMAIL PROTECTED] > wrote:

extract_min not possible cos that wud been a brand new sorting algorithms that runs in O(n) time.

On 3/25/06, Balaji Gopalan < [EMAIL PROTECTED]> wrote:

hi
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?]

balaji

On 3/25/06, ridvansg <[EMAIL PROTECTED]> wrote:

--
-- Mohammad
do you C?!!
double m[] = { 9580842103863.650391, 133470973390.236450, 270};
int main(){m[2]--?m[0]*=4,m[1]*=5,main():printf(m);}
--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---