Binary search:bsearch in stdlib.h : Search « Data Structure Algorithm « C / ANSI-C

Home
C / ANSI-C
1.assert.h
2.Console
3.ctype.h
4.Data Structure Algorithm
5.Data Type
6.Development
7.File
8.Function
9.Language Basics
10.Macro Preprocessor
11.Math
12.math.h
13.Memory
14.Pointer
15.setjmp.h
16.signal.h
17.Small Application
18.stdio.h
19.stdlib.h
20.String
21.string.h
22.Structure
23.time.h
24.wctype.h
C Tutorial
C++
C++ Tutorial
Visual C++ .NET
C / ANSI-C » Data Structure Algorithm » SearchScreenshots 
Binary search:bsearch in stdlib.h



#include <stdio.h>
#include <stdlib.h>

int values[] 310 };

int compare (const void * a, const void * b) {
  return *(int*)a - *(int*));
}

int main ()
{
  int *pos;
  int key = 9;
  
  pos = (int*bsearch (&key, values, 6, sizeof (int), compare);
  
  if pos != NULL )
    printf ("%d is in the array", *pos);
  else
    printf ("%d is not in the array", key);
  
  return 0;
}

           
       
Related examples in the same category
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.