binary search (need this for later)

binary_search.cpp

#include<iostream>
using namespace std;

bool bsearch(int AR[], int N, int VAL);

int main()
{
	int AR[100],n,val; // Array size will be declared by user, or I might change to vector if that'll work.
	bool found;

	cout<<"Enter number of elements you want to insert ";
	cin>>n;

	cout<<"Enter element in ascending order\n";

	for(int i=0;i<n;i++) // Will replace this loop with the random generation shit I've got already.
	{
		cout<<"Enter element "<<i+1<<":";
		cin>>AR[i];
	}

	cout<<"\nEnter the number you want to search ";
	cin>>val;

	found=bsearch(AR,n,val); // Literally the only line you'll need for the actual search.

	if(found)
		cout<<"\nItem found";
	else
		cout<<"\nItem not found";
	
	return 0;
}

bool bsearch(int AR[], int N, int VAL) // The actual function, yo.
{
	int Mid,Lbound=0,Ubound=N-1;
	while(Lbound<=Ubound)
	{
		Mid=(Lbound+Ubound)/2;
		if(VAL>AR[Mid])
			Lbound=Mid+1;
		else if(VAL<AR[Mid])
			Ubound=Mid-1;
		else
			return true;
	}
	return false;
}