The study of dichotomy method

1. Find the Dichotomy method

In general, the dichotomy is in the array, and the inside of the array is already sorted from large to small or small to large, and we need to find the values we need in these sorts.

intBinart (int*a,intKeyintN) {    intleft =0, right = N-1, Mid =0; Mid= (left + right)/2;  while((left<right) && a[mid]!=key) {        if(a[mid]<key) { Left= Mid +1; }        Else if(A[mid] >key) { Right= Mid-1; } Mid= (left + right)/2; }    if(A[mid] = =key) {        returnmid; }    return-1;}

2. Number of binary search methods

The dichotomy is found several times, the range is F, and the number of steps to find is S, then, S = log2 (f) + 1; The log here is low at 2. So when the range is 100, the number of lookups is 7, and when the range is 1000, the number of lookups is 10.

The study of dichotomy method