// sortTdd.cc  P. Conrad for CISC220
// test driven development of a Selection Sort

#include <iostream>
using namespace std;

#include <cassert>

#include "selectionSort.h"

#include "runTests.h"

void printArray(int a[], int n)
{
  for (int i=0;i<n;i++)
    {
      cout << a[i];
      if (i<n-1)
	cout << ",";
      else
	cout << endl;
    }

}

int main(void)
{
  RunTests_C test;
  

  int moreNums[] = {2, 2, 6, 4,  2, 999, 11};
  int moreNumsSorted[] = {2, 2, 2, 4, 6, 11, 999};

  cout << "Before the Sort" << endl;
  printArray(moreNums,7);
  sortArray(moreNums,7);

  cout << "After the Sort" << endl;
  printArray(moreNums,7);

  for (int i=0; i<7; i++)
    {
      test.assertEquals(moreNums[i],moreNumsSorted[i]);
    }


  test.print();
  test.finish();
  return 0;

}