Here, we will create an integer array and then we will search an item from the array using binary search.
In binary searching, we compare an item by finding the middle element. It is more efficient than linear search. But we use binary search in the case of the sorted array only.
Program/Source Code:
The source code to search an item into the array using binary search is given below. The given program is compiled and executed on the ubuntu 18.04 operating system successfully.
Output:
Explanation:
In the above program, we used an object-oriented approach to create the program. We created an object Sample, and we defined main() function. The main() function is the entry point for the program.
In the main() function, we created an integer array IntArray with 5 elements. Then we read an item from the user and search into the array using a binary search mechanism. After that, we printed the index of the item on the console screen.
need an explanation for this answer? contact us directly to get an explanation for this answer