#include<iostream>
#include<fstream>
#include<conio.h>
#include<string>
using namespace std;

int binary(int x[], int n, int  key)
{
	int low = 0;
	int hi = n - 1;
	while (low <= hi)
	{
		int mid = (low + hi) / 2;
		if (key == x[mid])
			return (mid);
		if (key < x[mid])
			hi = mid - 1;
		else
			low = mid + 1;

	}
	return -1;
}
int main()
{
	int a[10];

	for (int x = 0; x < 10; x++)
	{
		a[x] = rand()% 50;
	}
	for (int x = 0; x < 10; x++)
	{
		cout<<a[x] ;
		cout << " ";
	}

	int find;

	cout << endl<<"enter value to search in array"<<endl;
	cin >> find;
	int car = binary(a, 10, find);
	if(car!=-1)
	cout << "index of  " << find << " is:  " << car;
	else
    cout << "VALUE NOT PRESENT IN THE ARRAY" << endl;

	_getch();
	return 0;
}