vcwu

/*
CS 352, Summer '12
Victoria Wu

Polynomial ADT
poly.cpp
-----------------------------------------
The polynomial is represented by a linked list of pairs, each containing
the coefficient and exponents of each term. 
s

vcwu

/*
CS 352, Summer '12
Victoria Wu

Polynomial ADT
-----------------------------------------
The polynomial is represented by a linked list of terms, each containing
the coefficient and exponents of each term. 

-Add, Multiply, Equality functions for polynomials

vcwu

/*
CS 352, Summer '12
Victoria Wu

Polynomial ADT Tester
-----------------------------------------

*/

#include <iostream>

vcwu

	fstream simp;
	simp.open("simplify_test.txt");

	Poly* pol1 = new Poly();
	for(int i =0; i< 3; i++)
	{
		term t1(5, 1, 1);
		pol1->addTerm(t1);	
	}

vcwu

Poly* pol1 = new Poly();
	for(int i =0; i< 3; i++)
	{
		term t1(5, 1, i);
		pol1->addTerm(t1);
		term t2(5, 1, i);
		pol1->addTerm(t1);
		pol1->addTerm(t2);
	}

vcwu

	//Making a Testing Tree, with many physical, one logical obj. 
	//------------------------------------------------
	Treap<Student>* oneLogical = new Treap<Student>();
	oneLogical->insert(smallest);
	for(int x = 0; x< 2; x++)
	{
		oneLogical->insert(allStudents[x]);
		oneLogical->remove(allStudents[x]);
	}

vcwu

for(int i =10000; i<= 160000; i*=2)
{
	Treap<int>* time = new Treap<int>();
	begin = clock();
	for(int x = 0; x < i; x++)
	{
		time->insert(x);
	}
	end = clock();
		

vcwu

	for(int i =10000; i<= 160000; i*=2)
	{
		
		Treap<Student>* time = new Treap<Student>();
		
		Student hello;
		for(int x = 0; x < i; x++)
		{
			hello = Student(x);
			time->insert(hello);

vcwu

cout << "Finding Min Stuff " << endl << endl;

for(int i =100000; i<= 1600000; i*=2)
{
	
	Treap<Student>* time = new Treap<Student>();
	
	Student hello;
	for(int x = 0; x < i; x++)
	{

vcwu

for(int i =10000; i<= 160000; i*=2)
	{
		
		Treap<Student>* time = new Treap<Student>();
		
		Student hello;
		for(int x = 0; x < i; x++)
		{
			hello = Student(x);
			time->insert(hello);