Problem with recursive binary search?

#include<iostream>
using namespace std;
int midind, elements, first=0 , last=(elements-1);
int array1[5];
bool searches (int index , int search)
{
	if (index>=elements|| index<=0)
	{
		cout<<"The number "<<search<<" was not found!! \n";
		return false;
	}
	else if (search==array1[index])
	{
		cout<<"The number "<<search<<" was found and its index is "<<index<<" \n";
		return true;
	}
	else if (search>array1[index])
	{
	
		first= index; 
		index= static_cast<int>((first+last)*0.5);
		return searches (index, search);
	
	}
	else if (search<array1[index])
	{
		last = index;
		index = static_cast<int>((first+last)*0.5);
		return searches (index , search);
	}
	
}
void main ()
{
	int i, search;
	cout<<"Enter the number of elements of your integer array  \n";
	cin>>elements;
	cout<<"Enter the "<<elements<<" elements of your integer array in ascending order \n";
	for (i=0 ; i<elements ; i++)
	{
		cin>>array1[i];
	}
	cout<<endl<<"Your integer array is:"<<endl;
	for (i=0 ; i<elements ; i++)
	{
		cout<<array1[i];
		cout<<"\t";
	}
	cout<<endl<<endl;
	cout<<"Enter a number to search for: \n";
	cin>>search;
	midind= static_cast<int>((first+last)*0.5);
	searches (midind , search);
}