#include <iostream>
#include "SortAndSearch.h"

using namespace std;


int Find(const string ary[], size_t size, string key){
   size_t i;
   int rv = SEARCH_NOT_FOUND;

   for(i =0; i<size; i++) {
       if (ary[i] == key) {
          rv = i;
       }
   }

   return rv;
}

void InsertionSort(string ary[], size_t size){
    size_t last, i;
    string tmp;

    for(last =1; last < size; last++) {
       tmp = ary[last];
       i = last;
       while (i >0 and tmp < ary[i-1]) {
          ary[i] = ary[i-1];
          i--;
       }

       ary[i] = tmp;
    }
    return;
}