Computer Science, asked by swasan988, 10 months ago

Write a c program to search a given number from a sorted 1d array and display the position at which it is found using binary search algorithm. The index location starts from 1.

Answers

Answered by Anonymous
1

A binary search is a simplistic algorithm intended for finding the location of an item stored in a sorted list. There are a few variations to the binary search in C program, such as testing for equality and less-than at each step of the algorithm.

Binary search in C is an example of a simple process that can be used to dissolve complex problems. As such, it is an important foundational concept that you will find in almost all the good books on the C programming language.

Similar questions