// Test driver for template binary search function

#include <iostream>
using namespace std;
#include <vector>
#include "sort.h"
#include "bsearch.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);
    sort(ivals, ilen);
    cout << "ivals is: ";
    for (int i = 0; i < ilen; ++i)
        cout << ivals[i] << " ";
    cout << endl;
    cout << "mybsearch(-9, ivals, ilen) returns "
         <<  mybsearch(-9, ivals, ilen) << endl;

    cout << "mybsearch(8, ivals, ilen) returns "
         <<  mybsearch(8, ivals, ilen) << endl;

    cout << "mybsearch(88, ivals, ilen) returns "
         <<  mybsearch(88, ivals, ilen) << endl;
    cout << endl;

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

    cout << "mybsearch(\"peaches\", svals, slen) returns "
         <<  mybsearch("peaches", svals, slen) << endl;
    cout << endl;

    // STL vector of ints
    vector<int> v(ilen);
    srand((int)&v);
    for (int i = 0; i < v.size(); ++i)
        v[i] = rand() % 100;
    sort(v, v.size());
    cout << "v is: ";
    for (int i = 0; i < v.size(); ++i)
        cout << v[i] << " ";
    cout << endl;

    cout << "mybsearch(" << v[0] << ", v, v.size()) returns "
         <<  mybsearch(v[0], v, v.size()) << endl;

    cout << "mybsearch(" << v[6] << ", v, v.size()) returns "
         <<  mybsearch(v[6], v, v.size()) << endl;

    return 0;
}