Half search method

Binary search

The split search depends on the sequential table structure , In short, it's an array .

• Binary search is for ordered data .

• The amount of data is too small for binary search .

• Too much data is not suitable for binary search .

/*  fold   And a half   check   look for  */
 int Binary_Search (int *a, int n, int key ){
 int low , high , mid ;
 /*  set   The righteous   most   low   Next   mark   by   remember   record   The first   position  */
 low = 1;
 /*  set   The righteous   most   high   Next   mark   by   remember   record   At the end of the   position  */
 high = n;
 while (low <= high ) {
    /*  fold   And a half  */
     mid = ( low + high ) / 2;
     /*  if   check   look for   value   Than   in   value   Small  */
     if (key < a[mid ])
         /*  most   high   Next   mark   transfer   whole   To   in   position   Next   mark   Small   One   position  */
         high = mid - 1;
     /*  if   check   look for   value   Than   in   value   Big  */
     else if (key > a[mid ])
     /*  most   low   Next   mark   transfer   whole   To   in   position   Next   mark   Big   One   position  */
         low = mid + 1;
     else
     /*  if   phase   etc.   be   say   bright  mid  namely   by   check   look for   To   Of   position   Set up  */
     return mid ;
 }
 return 0;
 }