Hi everyone, I am stuck at places where I need to find lets say Binomial_coefficient(1000,10) mod 1000 000 007 . What is the best way to do this, assuming we donot have sufficient memory to use the naive approach : (n,r) = (n-1,r) + (n-1,r-1) .
-- Dipit Grover B.Tech in Computer Science and Engineering - lllrd year IIT Roorkee, India -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@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.
