why's the linked list option not constant (at least for most cases)? the time's not constant only for delete operation (that too only if you delete the current min)... otherwise, everything is a O(1) operation...
get_min() already has the min... push_rear(), pop_front() - you're maintaining the head and tail positions of the linked list... so u can easily do these... On Jan 9, 11:22 am, juver++ <avpostni...@gmail.com> wrote: > All operations should constant at least on average. > So your idea is not suitable. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
