Implementing A Polynomial Calculator

• Download source files - 181 Kb
• Download demo project - 134 Kb

Introduction

This project creates a polynomial class and supporting classes.  It implements polynomial addition, subtraction, multiplication, division etc…  It solves quadratic equations. It demonstrates dynamic arrays, operator overloading etc…

Using the code

The source code should be quite self-explanatory and easy to integrate.  Full comments and project files included. The compiled project includes a demonstration; getting polynomial coefficient inputs from user (and other inputs) and going through various polynomial calculations on screen.

//////////////////////////////////////////////////////////////////////
//   constructor
//
//   creates polynomial of size inSize and assigns coefficient values
//   from array of values input throws exception allocFail 
//   of type exception if 'new' fails
//
//   parameters:      inSize, polynomial size and values[] array of
//                    coefficients ***CAUTION** coefficients
//                    in the array are taken in natural form 
//                    starting with highest coefficient first
//////////////////////////////////////////////////////////////////////

poly::poly(int inSize, double values[])
{
	int i;

	try 
	{
	    //set up size for array
		size = inSize;
		//create dynamic array, assgn addr
		data = new double[size];
	} catch (...) 
	{
		throw (allocFail);
	}
	if (data != NULL)
	//check for wild pointer, double check
	{        
		for (i=0; i<size; i++)
		data[i] = values[size-1-i];
		//assign values allowing for reversed index input
	}
}

History

Written by Liam Rainford 2001.

This article has no explicit license attached to it but may contain usage terms in the article text or the download files themselves. If in doubt please contact the author via the discussion board below.

A list of licenses authors might use can be found here