I think it should be O(n) which is an obvious lower bound since we need to look at each rectangle at least once.
On 3/12/07, Balachander <[EMAIL PROTECTED]> wrote: > > > > 1. How to find the largest bound rectangle in a bar graph > > It seems a Google question was to solve this in O(Log n) > > Try any Soln..and Post it.. > > > > > --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
