insert sort, b-search

insert sort

1 2 3 4 5 6 7 8 9 10 11 12

// insert sort template <class Type, class Compare> void insert_sort(Type* array, int size, Compare compare) {     int i, j;     for (i=1; i< size; ++i) {         Type next = array[i];         for (j=i-1; 0<= j && compare(next, array[j]); --j) {             array[j+1] = array[j];         }         array[j+1] = next;     } }

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

//< b-search template <class Type> int binary_search(Type* array, int first, int last, const Type& key) {     while (first <= last)     {         int mid = (first + last) / 2;         if (key > array[mid])             first = mid +1;         else if (key < array[mid])             last = mid -1;         else             return mid;     }     return -(first+1); }