The Binary Search : Binary Search « Search Sort « C Tutorial

Home
C Tutorial
1.Language
2.Data Type
3.String
4.printf scanf
5.Operator
6.Statement
7.Array
8.Function
9.Structure
10.Pointer
11.Memory
12.Preprocessor
13.File
14.Data Structure
15.Search Sort
16.Wide Character String
17.assert.h
18.ctype.h
19.math.h
20.setjmp.h
21.signal.h
22.stdio.h
23.stdlib.h
24.string.h
25.time.h
26.wctype.h
C / ANSI-C
C++
C++ Tutorial
Visual C++ .NET
C Tutorial » Search Sort » Binary Search 
15.8.1.The Binary Search
#include<stdio.h>
 
  int binary_search(char *items, int count, char key)
  {
    int low, high, mid;

    low = 0; high = count-1;
    while(low <= high) {
      mid = (low+high)/2;
      if(key < items[mid]) 
          high = mid-1;
      else if(key > items[mid]) 
          low = mid+1;
      else 
          return mid; /* found */
    }
    return -1;
  }

  int main(void){
     char *str = "123456";
    
     int index = binary_search(str, 6'3');
    
     printf("%d",index);
  }
2
15.8.Binary Search
15.8.1.The Binary Search
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.