Question

write a program for binary search in 1d array
​

Answer 1

Answer:

Explanation:

Binary Search: Search a sorted array by repeatedly dividing the search interval in half. Begin with an interval covering the whole array. If the value of the search key is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise narrow it to the upper half. Binary search in C language to find an element in a sorted array. If the array isn't sorted, you must sort it using a sorting technique such as merge sort.

Binary Search in C Programming: A binary search is a simplistic Binary search algorithm applies to a sorted array for searching an element. For doing so, you can make use of some sorting technique, such as the bubble