A program to implement the binary search algorithm

A program to implement the binary search algorithm.

#include 

void binary_search(const int *, const int, const int);

int main(void)
{
  int arr[1000], i, v, cnt;

  /* Store the values in the array */
  for( i = 0; i < found =" 0;" fi="first" mi="milldle,li=" n =" 0;" fi =" 0;" li =" sz"> p[li])
  {
      printf( "\n%d not found in the array", val);
      printf( "\nNo of attempts = 1" );
  }
  else
  {
      printf( "\nAttempts\tFirst index\tLast index\tMiddle index\tarr[mi]" );
      while(1)
      {
          n++;
          /* Calculate middle index */
          mi = (fi + li) / 2;

          if( mi == fi || mi == li )
              break; /* Processing complete */

          printf( "\n\t%d\t%d\t\t%d\t\t%d\t\t%d", n, fi, li, mi, p[mi] );
          if(val == p[mi] )
          {
              found = 1;
              break;
          }

          if(val < li =" mi;"> p[mi])
          {
              fi = mi;
              continue;
          }
      }  /*End of while loop */
      if(found)
      {
          printf( "\n%d found in the array", val);
          printf( "\nNo of attempts = %d", n );
      }
      else
      {
          printf( "\n%d NOT found in the array", val);
          printf( "\nNo of attempts = %d", n );
      }
  } /*End of else */
}