// Test driver for template sort functions

#include <iostream>
using namespace std;
#include <vector>
#include "sort.h"


int main() {
    // Simple array of integer values
    int ivals[] = { -9, 8, 10, 39, -13, 22, 8, 18, 44, 100, 0 };
    const int ilen = sizeof(ivals)/sizeof(int);
    cout << "Before sorting, ivals is: ";
    for (int i = 0; i < ilen; ++i)
        cout << ivals[i] << " ";
    cout << endl;
    sort(ivals, ilen);
    cout << "After sorting, ivals is: ";
    for (int i = 0; i < ilen; ++i)
        cout << ivals[i] << " ";
    cout << endl;

    // Simple array of strings
    string svals[] = { "hello", "goodbye", "Apple", "pumpkin", "peaches" };
    const int slen = sizeof(svals)/sizeof(string);
    cout << "Before sorting, svals is: ";
    for (int i = 0; i < slen; ++i)
        cout << svals[i] << " ";
    cout << endl;
    sort(svals, slen);
    cout << "After sorting, svals is: ";
    for (int i = 0; i < slen; ++i)
        cout << svals[i] << " ";
    cout << endl;

    // Vector of ints
    vector<int> v(ilen);
    srand(12);
    for (int i = 0; i < v.size(); ++i)
        v[i] = rand() % 20;
    cout << "Before sorting, v is: ";
    for (int i = 0; i < v.size(); ++i)
        cout << v[i] << " ";
    cout << endl;
    sort(v, v.size());
    cout << "After sorting, v is: ";
    for (int i = 0; i < v.size(); ++i)
        cout << v[i] << " ";
    cout << endl;

    return 0;
}