There are two methods for computing those coefficients.
1) Use combinations. Find coefficient of by calculating , where 0 â‰¤ k â‰¤ n.
2) Use Pascal's triangle. nth line of this triangle contains coefficients of (a + b)n. kth element of
nth line is coefficient of . Each line can be generated by using the line on top of it.
Hint: See that triangle is symmetric.
This sample triangle has coefficients of each element in (a+b)n, from n = 0 to n = 10. First line is n=0. In each line, leftmost elements are k=0.
Source: [url removed, login to view]
This may sound simple, but when n is larger than 35, coefficients will not be able to fit in 32
bit unsigned integers. To handle with this problem, you will design and implement
BigUnsignedInteger class that can hold and operate on unlimited sized unsigned integers.
With the help of BigUnsignedInteger class, you will implement Pascal's triangle and
combinatorial solution for finding coefficients. You will write your code in C++ programming
language. You are not allowed to use any library except standard C++ library. In your code,
you will measure running times of both methods respectively (in milliseconds). In your
report, you will compare and contrast their asymptotical bounds (space and time).
Code (60 points)
13 freelancers are bidding on average $124 for this job
I am an undergraduate student I will do it more properly , along with bonus task and will do it easily.I will comment it properly so that it will be easy for anyone to understand.