@sravanreddy001 : complexity would be : O(R^2 * C) where R and C are no. of rows and column respectively.
On Wed, Jan 18, 2012 at 9:30 AM, sravanreddy001 <[email protected]>wrote: > Hi atul: > > Can u give the complexity for ur algorithm. > > I think of an O(m^2n^2) =~ O(n^4) algorithm, with constant space. > > The kadane's algo should be applied on a 2-d data right.. that takes the > complexity to order of 2. > > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/onh0-bxytOoJ. > > 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.
