// *****************************************************************
// Author:		Zhixiang Chen
// Class:		CSCI/CMPE 1170, Spring 2009
// Lab 26:		Insertion sort 
// Date:		January 12, 2009
// Revised on:  06/26/2009 by sirisha surisetty
// Comment:		The code here is meant to be revised.
//
//-----------------------------------------------------------------
//
// This lab exercise is to show how to do insertion sort.
//
// Compile and run your program. When everything is fine,
// print your .cpp and .h files and turn them to me or the TA.
// *****************************************************************

#include <iostream>
#include <fstream>
#include <string>
#include <cstring>
#include <cmath> 
#include <cstdlib>
#include <iomanip>

#include "lab_26_head.h" 

using namespace std; 

int main( )
{
	const int SIZE=100;			//list or array size
	int list[SIZE];				//list or array
	int count;					//comparisons of performance metric

	//load list with random numbers
	loadList(list, SIZE); 
		
	//show list
	cout<<"Before sorting, the list is ....." <<endl; 
	showList(list, SIZE); 

	//linear search 
	insertionSort(list, count, SIZE); 
	
	//show list
	cout<<"After sorting, the list is ......" <<endl; 
	showList(list, SIZE); 
	
	//show count
	cout<<"The number of comparisons for insertion sort are "<<count<<endl;	
	/**********************************************************************
	 This part is for you: Write a selection sort to sort a list of words.
	 You need to implement the following functions: 
	 (1) loadWordList(...) //this function loads words from data file 
		 "lab_24_data.txt"
	 (2) insertionWordSort(...)
	 (3) showWordList(...)
	 and have a similar driver to test your implementation.
	 **********************************************************************/
		


	//well done and exit
	return 0; 
}