View the step-by-step solution to:

Question

How to make efficient

implementation for C(N,K) using pascals triangle. By creating a function C(N,K) which prints out the value C(1000,250) and C(1000,750) (which should be the same, and why is it the same). I believe you can use the recursive definition based on Pascal's Triangle, but im not sure how! please show and explain thanks!

I also think based on the rules of pascals triangle you only need to calculate the numbers on the upper diagonal. is this wrong?

Recently Asked Questions

Why Join Course Hero?

Course Hero has all the homework and study help you need to succeed! We’ve got course-specific notes, study guides, and practice tests along with expert tutors.

-

Educational Resources
  • -

    Study Documents

    Find the best study resources around, tagged to your specific courses. Share your own to gain free Course Hero access.

    Browse Documents
  • -

    Question & Answers

    Get one-on-one homework help from our expert tutors—available online 24/7. Ask your own questions or browse existing Q&A threads. Satisfaction guaranteed!

    Ask a Question
Ask Expert Tutors You can ask 0 bonus questions You can ask 0 questions (0 expire soon) You can ask 0 questions (will expire )
Answers in as fast as 15 minutes