M is a matrix, not a number. M is NxN, so the algorithm is O(N^3) as stated in the text.
On Apr 10, 4:19 pm, rahul sharma <rahul23111...@gmail.com> wrote: > isnt the complexity should be o(m*n*n) instead of (n*n*n) as m can be > greater than n..plz comment > > On Wed, Apr 10, 2013 at 10:11 PM, rahul sharma <rahul23111...@gmail.com>wrote: > > > > > > > > > > >http://www.geeksforgeeks.org/dynamic-programming-set-27-max-sum-recta... > > > wat is complexity of this....n3 or mn2???? -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
