@Dave bt the heap build operation is O(n) there is a proof fr this On Tue, Jul 5, 2011 at 6:29 AM, saurabh singh <[email protected]> wrote:
> Yes I know I said it with regard to the current problem > > On Tue, Jul 5, 2011 at 8:58 AM, Dave <[email protected]> wrote: > >> @Saurabh: Nope. You can construct a heap in-place. But it is not O(n). >> >> Dave >> >> On Jul 4, 10:02 pm, saurabh singh <[email protected]> wrote: >> > Again heap will require extra space. >> > >> > On Tue, Jul 5, 2011 at 8:25 AM, vaibhav agarwal >> > <[email protected]>wrote: >> > >> > >> > >> > >> > >> > > what abt this... >> > > check length of the array if same then we make a min heap of both the >> > > arrays which can be done in O(n) and call extraxtmin(). in this way we >> can >> > > find whether they r equal. >> > > othwersie nt equal. >> > >> > > correct me if i am wrong!! >> > >> > > On Mon, Jul 4, 2011 at 4:35 AM, saurabh singh <[email protected]> >> wrote: >> > >> > >> Lets conclude this post.Shall we? >> > >> .An o(n) seems infeasible without any significant extra memory.... >> > >> If extra memory is allowed,hash maps can be used to bring it down to >> > >> o(logn).But hash maps would eat up serious memory if numbers occupy a >> large >> > >> range. >> > >> > >> -- >> > >> You received this message because you are subscribed to the Google >> Groups >> > >> "Algorithm Geeks" group. >> > >> To post to this group, send email to [email protected]. >> > >> To unsubscribe from this group, send email to >> > >> [email protected]. >> > >> For more options, visit this group at >> > >>http://groups.google.com/group/algogeeks?hl=en. >> > >> > > -- >> > > You received this message because you are subscribed to the Google >> Groups >> > > "Algorithm Geeks" group. >> > > To post to this group, send email to [email protected]. >> > > To unsubscribe from this group, send email to >> > > [email protected]. >> > > For more options, visit this group at >> > >http://groups.google.com/group/algogeeks?hl=en. >> > >> > -- >> > Saurabh Singh >> > B.Tech (Computer Science) >> > MNNIT ALLAHABAD- Hide quoted text - >> > >> > - Show quoted text - >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> >> > > > -- > Saurabh Singh > B.Tech (Computer Science) > MNNIT ALLAHABAD > > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
