A C-Program for bairstow's method. Description: Write a computer program that will take a polynomial of degree n, (maximum value of n=10.) and will determine its roots using Bairstow's method. Input: The input to the program will be n, the coefficients of the polynomial and the initial values of r and s. Output: 1. Print the polynomial. 2. For each iteration, print the starting value of r and s, the b’s, the c’s, the computed value of Δr and Δs, and the approximate error. Repeat until the convergence takes place. 3. Go back to step #1 for the remaining n-2 degree polynomial. For this step, the starting values of r and s should be automatically generated. 4. Continue until all the roots are found. 5. Print the original polynomial in the factored form and its n roots.
## Deliverables
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Deliverables must be in ready-to-run condition, as follows (depending on the nature of the deliverables):
a) For web sites or other server-side deliverables intended to only ever exist in one place in the Buyer's environment--Deliverables must be installed by the Seller in ready-to-run condition in the Buyer's environment.
b) For all others including desktop software or software the buyer intends to distribute: A software installation package that will install the software in ready-to-run condition on the platform(s) specified in this bid request.
3) All deliverables will be considered "work made for hire" under U.S. Copyright law. Buyer will receive exclusive and complete copyrights to all work purchased. (No GPL, GNU, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site per the coder's Seller Legal Agreement).
## Platform
Windows XP", "in all 6.0+ versions of Internet Explorer and 2.0+ versions of Firefox", "Linux"