Binary search algorithm implementation in C

Binary search:

Binary search algorithm implementation in C

Binary search is a searching algorithm that can search first-er, then Sequential search. It's executed in O (log N) time.

A binary search can
only be performed if the list is in sorted order.

Here is the C code of binary search:

#include <stdio.h> int main() { int c, first, last, middle, n, search, array[50]; printf("Enter number of elements\n"); scanf("%d",&n); printf("Enter %d integers\n", n); for ( c = 0 ; c < n ; c++ ) scanf("%d",&array[c]); printf("Enter value to find\n"); scanf("%d",&search); first = 0; last = n - 1; middle = (first+last)/2; while( first <= last ) { if ( array[middle] < search ) first = middle + 1; else if ( array[middle] == search ) { printf("%d found at location %d.\n", search, middle+1); break; } else last = middle - 1; middle = (first + last)/2; } if ( first > last ) printf("Not found! %d is not present in the list.\a\n", search); return 0; }

Conclusion:

The binary search algorithm is a fast and efficient way to search for a specific element in a sorted list. It operates in O(log N) time, making it much quicker than sequential search in most cases. However, it can only be used on sorted lists. The C code provided can be used as a template for implementing binary search in your programs.

The Java code for Binary Search is here.
Comment if any questions or inquiries.

You may like:

Binary search in java                                                 Depth First Search ( DFS ) in java 

Bubble sort in java                                                                                    Topological sort