재귀로 이진탐색알고리즘짠건데


배열에서 잘못한건가

#include <stdio.h>

int Bserch( int index, int arr[], int first, int last )
{
   int mid;

   mid = (last + first) / 2;

   if (arr[mid] == index)
      return mid;

   else if (arr[mid] < index)
      return Bserch(index, arr, first, mid - 1 );

   else
      return Bserch(index, arr, mid + 1, last);
}


int main()
{
   int arr[101], num , output;

   for (num = 0; num <= 100; num++)
   {
      arr[num] = 2 * num;
   }

   output = Bserch(26, arr, 1, 100);
  
   printf(" %d ", output);

   return 0;
}