C C++ Java Data Structure Python JavaScript CSS Ajax PL/SQL PHP Puzzles C programs C++ programs Java programs

Home » Code Snippets » C/C++ Data Structure programs

Binary Searching Data Structure Example in C - C program to find an element using Binary Searching from an Array.

Binary Searching is a half – interval Searching Algorithm in which a element can be searched in sorted array with minimum number of comparisons, in this algorithm key element compares with the middle index item.

Binary Searching Implementation using C program

    program to implement Binary Searching,
    to find an element in array.
#include <stdio.h>
/*  function    : BinaryrSearch() */
int BinaryrSearch(int x[],int n,int item) 
    int L=0;        /*LOWER LIMIT   */
    int U=n-1;      /*UPPER LIMIT   */
    int mid;        /*MIDDLE INDEX  */
    while( L< U) 
        if(x[mid]==item)     return mid; 
        else if(x[mid] < item)    L=mid+1; 
        else if(x[mid] > item)    U=mid-1; 
    return -1; 
int main() 
    int num=0,pos=0; 
    int ar[10],i; 
    printf("\nEnter array elements (in ASC Order...):\n"); 
        printf("Enter element %02d :",i+1); 
    printf("\nEnter element to be searched :"); 
    if(pos!=-1) { printf("\nItem found @ %02d location.\n",pos);} 
    else        { printf("\nItem not found.\n"); } 
    return 0;


    Enter array elements (in ASC Order...):
    Enter element 01 :10                                                                                                                                                            
    Enter element 02 :20                                                                                                                                                            
    Enter element 03 :30                                                                                                                                                            
    Enter element 04 :40                                                                                                                                                            
    Enter element 05 :50                                                                                                                                                            
    Enter element 06 :60                                                                                                                                                            
    Enter element 07 :70                                                                                                                                                            
    Enter element 08 :80                                                                                                                                                            
    Enter element 09 :90                                                                                                                                                            
    Enter element 10 :100                                                                                                                                                           
    Enter element to be searched :80                                                                                                                                                
    Item found @ 07 location. 

Liked this article? Do share with your friends :)