Binary Search

void main ()

{ int array[6] = {1,2,3,4,5,6};

int h, x = 4, a = 0, b = 5;

while (a+1 != b)

{ h = (a+b) /2;

if (array[h] <= x )

{ a = h;}

else

{ b = h;}

}

cout<< "x is " <<x<<endl;

cout <<"It is stored at position "<<h<<endl;

}

Previous slide

Next slide

Back to first slide

View graphic version