#include <fstream.h>
#include "apvector.h"

void sequentialSort(apvector <int>&);
void insertionSort(apvector <int>&);
void bubbleSort(apvector <int>&);
void mergeSort(apvector <int>&);
void quickSort(apvector <int>&);
void display(apvector <int>);
apvector <int> getnum();

void main()
{
	int x;
	apvector <int> num;
	while(x!=6)
	{
		num=getnum();
		cout << "1:Selection Sort" << '\n' << 
				"2:Insertion Sort" << '\n' << 
				"3:Bubble Sort" << '\n' << 
				"4:Merge Sort" << '\n' << 
				"5:Quick Sort" << '\n' << 
				"6: Quit"<<'\n' <<
				"Enter your selection: ";
		cin>> x;
		system("CLS");
		switch (x)
		{
		case 1:			
			sequentialSort(num);
			display(num);
			break;
		case 2:
			insertionSort(num);
			display(num);
			break;
		case 3:
			bubbleSort(num);
			display(num);
			break;
		case 4:
			mergeSort(num);
			display(num);
			break;
		case 5:
			quickSort(num);
			display(num);
			break;
		default:
			break;
		}
		
	}	
}

void sequentialSort(apvector <int>&x)
{
	int min;
	for(int i=0;i<x.length();i++)
	{
		min=i;
		for(int j=i+1;j<x.length();j++)
		{
			if(x[j]<x[min])
			{
				min=j;
			}
		}
		j=x[min];
		x[min]=x[i];
		x[i]=j;
	}
}

void insertionSort(apvector <int>&x)
{
	int key,j;
	for(int i=1;i<x.length();i++)
	{
		key=x[i];
		j=i;
		while(x[j-1]>key)
		{
			x[j]=x[j-1];
			j--;
			if(j==0)
			{
				break;
			}
		}
		x[j]=key;
	}
}

void bubbleSort(apvector <int>&x)
{
	int temp;
	for(int i=0;i<x.length();i++)
	{
		for(int j=1;j<x.length()-i;j++)
		{
			if(x[j-1]>x[j])
			{
				temp=x[j-1];
				x[j-1]=x[j];
				x[j]=temp;
			}
		}
	}
}

void mergeSort(apvector <int>&x)
{

}

void quickSort(apvector <int>&x)
{
	
}

void display(apvector <int>num)
{	
	for(int i=0;i<num.length();i++)
	{
		cout << num[i] << ' ';
		if((i+1)%10==0)
		{
			cout <<'\n';
		}
	}
	cout <<'\n';
}

apvector <int> getnum()
{
	ifstream in;
	apvector <int> num;	
	in.open("Ch19Projdata.txt",ios::in);
	for(int i=0;!in.eof();i++)
	{
		num.resize(i+1);
		in>>num[i];
	}
	num.resize(i-1);
	in.close();
	return num;
}