/**
 * test3.c - A slightly more systematic test of the binary_search routine.
 */

#include "bs.h"
#include <stdio.h>
#include <stdlib.h>

void
report (int value, int values[], int count)
{
  printf ("The position of %d is %d.\n", 
          value, 
          binary_search (value, values, count));
} // report

int
main ()
{
  int i;
  int values[] = { 0, 2, 4, 6, 8, 10 };

  for (i = -1; i <= 11; i++)
    report (i, values, 6);

  return EXIT_SUCCESS;
} // main