@Saurabh: Nope. You can construct a heap in-place. But it is not O(n). Dave
On Jul 4, 10:02 pm, saurabh singh <saurab...@gmail.com> wrote: > Again heap will require extra space. > > On Tue, Jul 5, 2011 at 8:25 AM, vaibhav agarwal > <vibhu.bitspil...@gmail.com>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 <saurab...@gmail.com> 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 algogeeks@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. > > > -- > > 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 > > algogeeks+unsubscr...@googlegroups.com. > > 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 algogeeks@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.
