Sintak Searhcing Binary

#include
#include

int data[10] = {1,3,4,7,12,25,40,65,78,90};

int binary_search(int cari)
{

int l,r,m;
int n = 10;
l = 0;
r = n-1;
int ketemu = 0;
while(l<=r && ketemu==0) { m = (l+r)/2; if( data[m] == cari ) ketemu = 1; else if (cari < r =" m-1;" l =" m+1;" ketemu ="="">cari;
hasil = binary_search(cari);
if(hasil == 1)
{
cout<<"Data ada!"<<<"Data Tidak ada!"<