InsertionSort.cpp

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

using namespace std;


//-------------------------------------------------------------------------------------------------
// Function Name:     InsertionSort
// Purpose:           InsertionSort constructor initializes the sort table
// Parameters:        int* theValues in the unsorted list
// Returns:           none
// Pre-conditions:    none
// Post-conditions:   theList contains a pointer to the unsorted list
//-------------------------------------------------------------------------------------------------
InsertionSort::InsertionSort(int theCount, int* theList)
{
    this->theCount = theCount;
    this->theList = theList;
}


//-------------------------------------------------------------------------------------------------
// Function Name:     ~InsertionSort
// Purpose:           ~InsertionSort destructor performs house cleaning when the class is destroyed
// Parameters:        none
// Returns:           none
// Pre-conditions:    none
// Post-conditions:   none
//-------------------------------------------------------------------------------------------------
InsertionSort::~InsertionSort()
{
    if (theList != nullptr)
        delete[] theList;

    theCount = 0;
    theList = nullptr;
}


//-------------------------------------------------------------------------------------------------
// Function Name:     sort
// Purpose:           sort the list using the Insertion Sort algorithm
// Parameters:        none
// Returns:           none
// Pre-conditions:    theList contains a valid pointer to an array of ints
// Post-conditions:   theList is sorted
//-------------------------------------------------------------------------------------------------
void InsertionSort::sort()
{
    if (theCount <= 1 || theList == nullptr)
        return;

    // consider the first position as already sorted
    for (int insertPtr = 1; insertPtr < theCount; insertPtr++)
    {
        // save the location and value where the insertion will occur
        int tmpPtr = insertPtr;
        int tmpValue = theList[insertPtr];

        // if the current value is less than the previous swap it
        while (tmpPtr > 0 && tmpValue < theList[tmpPtr - 1])
        {
            // shift all values until either reaching the beging of the list,
            // or the values are sorted
            theList[tmpPtr] = theList[tmpPtr - 1];
            tmpPtr--;
        }

        // insert the value
        theList[tmpPtr] = tmpValue;
    }
}


//-------------------------------------------------------------------------------------------------
// Function Name:     saveList
// Purpose:           saves the list (sorted or unsorted) to the specified filename
// Parameters:        const char* filename is the filename to write the list to
// Returns:           true if successful, false otherwise
// Pre-conditions:    filename is not null
// Post-conditions:   none
//-------------------------------------------------------------------------------------------------
bool InsertionSort::saveList(const char* filename)
{
    if (filename == nullptr)
        return false;

    ofstream outFile(filename);

    //outFile.open(filename);
    if (!outFile.good())
        return false;

    if (theList == nullptr)
    {
        theCount = 0;
        outFile << "theList was null. nothing to save." << endl;
    }

    for (int x = 0; x < theCount; x++)
        outFile << theList[x] << endl;

    outFile.close();
    return true;
}