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.
