Two-point Search

A very simple algorithm, which is now used in the form of loops. Note that the middle variable is set to x+ (Y-x)/2 (purple Book said to ensure near the beginning of the interval) to the left of the larger set to X=t+1, the right to small set to y=t; code (basic idea, you can change the implementation process freely)

int bs(int n){    int sum=1;    int x=1;    int y=1000;    int t;    while(x<y)    {        t=x+(y-x)/2;        if(t==n)        {            num[p++]=t;            break;        }        else if(t<n)        {            num[p++]=t;            x=t+1;        }        else if(t>n)        {            num[p++]=t;            y=t;        }        sum++;    }    return sum;}

Two-point Search