I am not sure if this algorithm have complexity O(n^2). If the table is composed by nxm cells then your algorithm have time complexity O(nm) e memory complexity O(nm). Wladimir Araujo Tavares http://www.si.ufc.br/~wladimir <http://www.si.ufc.br/%7Ewladimir/> "Fiz uma faculdade! Só não fiz a segunda porque acabaram os tijolos."
On Thu, Dec 16, 2010 at 7:11 AM, Greed <[email protected]> wrote: > for i=1 to n > for j=1 to n > coins[i][j]=coins[i][j]+ max(coins[i-1][j],coins[i][j-1]); > This is a bottom up DP. Time complexity O(n^2) > > > > -- > 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]<algogeeks%[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.
