since this only allows you to go right or down, the easiest(easy to understand) way is to draw a binary tree, then you will have a pretty good view on what you have to do. basically recursion from top going down(return the end node(bottom) and compare left and right
On Sep 30, 5:27 am, Christi Massey <masseychri...@gmail.com> wrote: > A table composed of N*M cells,each having a certain quantity of apples, is > given. you start from the upper-left corner. At each step you can go down or > right one cell.Design an algorithm to find the maximum number of apples you > can collect ,if you are moving from upper-left corner to bottom-right > corner. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@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.
