Binary Search Using Functions in C

About this program

This is an example program in c searching programs. Read the concept first: C Array, then study the code and output below.

Definition:

Binary search is a quickest search algorithm that finds the position of a target value within a sorted array

Also Called,

• half-interval search
• logarithmic search
• binary chop

Simple Binary Searching Program using functions

/* Simple Binary Search Program Using Functions in C*/
/* Data Structure Programs,C Array Examples */

#include<stdio.h>
#include<conio.h>

#define MAX_SIZE 5

void binary_search(int[],int);

int main() {
    int arr_search[MAX_SIZE], i,element;

    printf("Simple Binary Search Example - Array and Functions\n");
    printf("\nEnter %d Elements for Searching : \n", MAX_SIZE);
    for (i = 0; i < MAX_SIZE; i++)
        scanf("%d", &arr_search[i]);

	printf("Enter Element to Search : ");
    scanf("%d", &element);
   

    binary_search(arr_search,element);
    getch();
}

void binary_search(int fn_arr[],int element) {
   int f = 0, r = MAX_SIZE,mid;
   
   while (f <= r) {
	  mid = (f+r)/2;

	  if (fn_arr[mid] == element) {
         printf("\nSearch Element  : %d  : Found :  Position : %d.\n", element, mid+1);
         break;
	  }
      else if (fn_arr[mid] < element)
         f = mid + 1;    
      else
         r = mid - 1;
   }
   
   if (f > r)
      printf("\nSearch Element : %d  : Not Found \n", element);
}

Sample Output

Simple Binary Search Example - Array and Functions

Enter 5 Elements for Searching :
1001
1020
3002
4001
5000
Enter Element to Search : 3002

Search Element  : 3002  : Found :  Position : 3.

How It Works

This C program demonstrates Binary Search Using Functions. It first reads the required values as input, then walks through the data with a loop to compute the result, and finally prints the output shown in the Sample Output above.

1. Declare the variables that hold the program’s data.
2. Read the input values that the program will work with.
3. Iterate over the data using a loop to apply the logic.
4. Use conditional statements to handle the different cases.
5. Print the final result to the console so you can compare it with the sample output.

Try changing the input values and re-running the program to see how the output changes — this is the fastest way to understand how the logic behaves.

Related Pages

Learn the concept first, then study the code:

• Data Structures — Browse all Data Structures.
• C Array — Concept — search algorithms use array indexing.
• Simple Binary Searching Program in C — More in c searching programs.
• Simple Linear Search Example Program in C — More in c searching programs.