Programming Tutorials

#include 


// Function prototypes.
void GetList(vector  &theList, int n);
void PrintList(const vector  &theList, int n);
void SelectSort(vector  &theList, int n);
int IndexOfLeast(const vector &theList, int start, int n);

int main( void )
{
        vector  theList(10);
        
        GetList(theList,10);
        SelectSort(theList,10);
        PrintList(theList,10);

        return 0;
}

void GetList(vector  &theList, int n)
{       // Given:   A vector of integers and the number of
        //          integers to read into it.
        // Results: Reads in integers and fills the vector.
        int i;
        
        for (i=0; i> theList[i];
                cout << endl;
        }
}

void PrintList(const vector  &theList, int n)
{       // Given:   A vector of integers and the number of its
        //          elements to print out.
        // Results: The first n integers of the vector are displayed.
        int i;
        
        for (i=0; i &theList, int n)
{		// Given:	A vector of integers and the number of 
		//			integers in that vector.
		// Results:	The integers in the vector are sorted.
		
		int i;
		int IofLeast;
		int temp;
		
		for (i=0; i < n; i++)
		{
			// Find the location of the smallest number in the
			// vector between locations i and n.
			IofLeast = IndexOfLeast(theList,i,n);
			
			// Swap the values of the ith location and the 
			// location that contains the smallest number.
			temp = theList[IofLeast];
			theList[IofLeast] = theList[i];
			theList[i] = temp;
		}	
}

int IndexOfLeast(const vector  &theList, int start, int n)
{		// Given:	A vector of integers.  The index at which
		//			to start searching that vector for the smallest
		//			integer.  The length of the vector.
		// Returns:	The index of the smallest integer in the vector
		//			between locations i and n.

		int i;
		int IofLeast = start;
		
		for (i=start + 1; i < n; i++)
		{
			if 	(theList[i] < theList[IofLeast])
			{
				IofLeast = i;
			}
		}
		
		return IofLeast;
}