Struktur Data : Carian Binari

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30

#include <stdio.h> void binarySearching (int data[]) { int start=0, end=9, status=0, n, middle; printf("\n\n Integer to search :"); scanf("%d",&n); printf("\n\t Index \tData"); while((status!=1)&&(start<=end)) { middle=(start+end)/2; printf("\n\t %d\t%d", middle,data[middle]); if(n==data[middle]) status=1; else if(n<data[middle]) end=middle-1; else start=middle+1; } if(status!=1) printf("\n\t Oppss..data not found!!\n"); } int main(void) { int array[9]={2,4,6,8,10,12,14,16,18,20}; binarySearching(array); return 0; }