dude n for build tree and n in this for finding maximun??so n*(n/2)=o(n^2) On Mon, Nov 5, 2012 at 8:54 PM, shady <sinv...@gmail.com> wrote:
> Here the time complexity of the solution should be O(n * log(n)).... > http://www.geeksforgeeks.org/archives/21781 > > -- > 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.
