(m+n)C(n)
On Thu, Feb 21, 2013 at 1:26 PM, shady <sinv...@gmail.com> wrote: > Given a matrix of size mXn, find the number of paths from the top left > cell to the bottom right cell. > > BFS is one way... any other approach ? > > -- > 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. > > > -- 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.
