/* nag_search_vector(m01fsc) Example Program
 *
 * Copyright 1990 Numerical Algorithms Group.
 *
 * Mark 2 revised, 1992.
 * Mark 5 revised, 1998.
 * Mark 7 revised, 2001.
 *
 */

#include <nag.h>
#include <stdio.h>
#include <nag_stdlib.h>
#include <nag_stddef.h>
#include <nagm01.h>

#ifdef __cplusplus
extern "C" {
#endif
static Integer NAG_CALL compare(const Nag_Pointer a,const Nag_Pointer b)
{
  double x = *((const double *)a);
  double y = *((const double *)b);
  return (x<y ? -1 : (x==y ? 0 : 1));
}
#ifdef __cplusplus
}
#endif


int main(void)
{
  double key, vec[50];
  size_t i, n;
  Pointer match;

  /* Skip heading in data file */
  Vscanf("%*[^\n]");
  Vprintf("m01fsc Example Program Results\n");
  /* Read number of points and number to search for */
  Vscanf("%lu%lf", &n, &key);
  if (n>=0)
    {
      for (i=0; i<n; ++i)
        Vscanf("%lf",&vec[i]);
      if (m01fsc((Pointer) &key, (Pointer) vec, n, (ptrdiff_t)(sizeof(double)),
                 compare, Nag_Ascending, Nag_First, &match, NAGERR_DEFAULT))
        {
          Vprintf("Exact match found: ");
          Vprintf("First match index: %ld\n", (double *)match - vec);
        }
      else
        {
          Vprintf("No exact match found: ");
          if (match!=NULL)
            Vprintf("Nag_First nearest match index = %ld\n", (double *)match - vec);
          else
            Vprintf("No match in the input array\n");
        }
      return EXIT_SUCCESS;
    }
  else
    {
      Vfprintf(stderr, "Data error: program terminated\n");
      return EXIT_FAILURE;
    }
}