Binary_Search

Binary_Search

#include

#include

#include

int main() {

int data[9]={3,9,11,12,15,17,23,31,35};

int l,r,m;

int n=9;

int cari=17;

clrscr();

l=0;

r=n+1;

int ktm=0;

while(l<=r&&ktm==0) {

m=(l+r)/2;

printf("Data tengah: %d\n",m);

if(data[m]==cari) ktm=1;

else if(cari

printf("cari dikiri\n");

r=m-1;

}

else {

r=m+1;

printf("cari dikanan\n");

}

}

if(ktm==1) printf("Data ada!\n");

else printf("Data tidak ada!\n");

getch();

}