// *****************************************************************
// Author:	Zhixiang Chen
// Class:	CSCI/CMPE 1170, Spring 2009
// Lab 25:	Selection sort 
// Date:	January 12, 2009
// Comment: The code here is meant to be revised.
//
//-----------------------------------------------------------------
//
// This lab exercise is to show how to do selection 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_25_head.h" 

using namespace std; 

int main( )
{
	const int SIZE=10;			//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 
	selectionSort(list, count, SIZE); 
	
	//show list
	cout<<"After sorting, the list is ......" <<endl; 
	showList(list, SIZE); 
	
	//show count
	cout<<"The number of comparisons for bubble sort is "<<count<<endl; 

	/******************************************************************
	 This part is for you: Write a selection sort to sort a list of words.
	 You need to implement the dollowing functions: 
	 (1) loadWordList(...) //this function loads words from data file 
		 "lab_24_data.txt"
	 (2) selectionWordSort(...)
	 (3) showWordList(...)
	 and have a similar driver to test your implementation.
	 ******************************************************************/
		


	//well done and exit
	return 0; 
}