Binary Search Recursion help

[Final9mare]

Hi I need help with coding the function where I search for an element in an array. I keep getting a infinite recursion can someone help me with what to do with the function I commented //need help here. Thanks alot guys

#include <iostream>
using namespace std;

void binarysearch (const int sortedlist[], int firsty, int lasty, int value);

int main( ) {

int list[10] = {13,16,30,42,63,69,78,84,100,200};
int element;
int middle;
int first;
int last;

for( int i = 0; i  < 10; i++){
cout <<"[" << list[i] << "] ";
}
middle = 0+9/2;
cout << endl <<"Please enter number to be searched: ";
cin >> element;
if(list[middle] < element){
    first = middle+1;
    last = 10;
    binarysearch(list, first, last, element);
    }

else if(list[middle] > element){
    first = 0;
    last = middle-1;
    binarysearch(list, first, last, element);
    }

else{
    cout << "Found it" << list[middle];
    }
}



void binarysearch (const int sortedlist[], int firsty, int lasty, int value) {
int center;
cout << "Searching.....";
for(int p=firsty; p <= lasty; p++){
cout <<"[" << sortedlist[p] << "] ";
}
cout << endl;
center = firsty+lasty/2;
if(center > value){
    //Need help here
    binarysearch(sortedlist, firsty, lasty, value);
    }
else if (center < value){
    //Need help here
    binarysearch(sortedlist, firsty, lasty, value);
    }
else if(center == value){
    cout << "Found it" << value;
}
}

[Zhuge]

Your recursive calls to your binarysearch() function need to operate on a smaller section of the list; if you know that the center is greater than the value you are looking for, for example, what portion of the list does the value have to lie in?