Binary Search In C Programming
In this blog, you will learn how to find the binary search in C programming.
Introduction
- In the programming, I am going to explain how to find the binary search in C programming.
- It is used for sorted arrays and compared to linear search, it is faster.
Software Requirements
Programming - #include < stdio.h >
- int main()
- {
- int c, first, last, middle, n, search, array[100];
- 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.\n", search);
- return 0;
- }
Explanation
- With the help of the programming given above, the binary search is used to find the desired element in the list.
- If the element is searched, it can be printed.
Output