Demos and Speedtests ***

To demonstrate and evaluate the root finding implementations the program contains 8 predefined demos, which contain different tests and runs of groups of polynomials.

Demos 1-5 are simple examples used to illustrate the workings of the algorithms.

Demos 6-8 are speedtests which will repeat the algorithms a large number of times and calculate their average speed for three different sets of polynomials.