Well, (m+n) C (n) is the answer only in the case the allowable moves are : one step towards Right, and one step towards bottom.
On Thu, Feb 21, 2013 at 2:05 PM, shady <[email protected]> wrote: > How did you directly arrive at that solution ? Can you please explain > > > On Thu, Feb 21, 2013 at 1:52 PM, Gaurav Rana <[email protected]>wrote: > >> (m+n)C(n) >> >> >> On Thu, Feb 21, 2013 at 1:26 PM, shady <[email protected]> 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 [email protected]. >>> 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 [email protected]. >> 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 [email protected]. > For more options, visit https://groups.google.com/groups/opt_out. > > > -- Kumar Ankit Senior Undergraduate Department of Computer Engineering Institute of Technology Banaras Hindu University Varanasi Ph: +91 9473629892 -- 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 [email protected]. For more options, visit https://groups.google.com/groups/opt_out.
