Sorting.cpp

#include <iostream>
#include <stdlib.h>
#include <vector>
#include "Tests.h"

using namespace std;


int main()
{
	Tests to;
	int a[4]= {4, 5, 6 , 9};
	to.IntegerSorter(a);// test object
	/*system("clear");
	cout << "\tSorting Program\n" << endl;
	int a[] = { 5, 2, 2, 3 , 67, 99 };
	//float b[] = { 5.9f, 2.5f, 2.3f, 3.5f , 67.0f, 99.8f };

	cout << "Test 1: Sorting Integers" << endl;
	cout << sizeof(a)/sizeof(a[0]) << endl;
	Tests:IntegerSorter(a);
	cout << "\nTest 2: Sorting Float Numbers" << endl;

	cout << "Test 3: Sorting Integers and Floating Point numbers" << endl;*/
	cin.get();
}

//REQUIREMENTS //
//1. Sort a finite amount of real numbers. (Create an algorithm)
	//1a. Can sort integers and floating point numbers
//2. Sort just floating point objects
	//a. real numbers
	//b. negative zero
	//c. negative infinity
	//d. posiive infinity
	//e. NaN objects
//3. Can sort a list of length 0 - Return error
//4. Can sort a list of length 1
//5. Can sort a list of length 2
//6. Can sort a list of variable length
//7. Can sort a list with at least two equal elements
//8. Times the sorting algorithm by any machine implemented method
//9. Gives a table of time versus number of elements sorted
//10. Gives a graph of time versus number of elements sorted
//11. Bonus for original work or conventional work done exceptionally well
//12. Report in PDF file