Question

write a c program to demonstrate binary search!​

Answer 1

Answer:

There is your answer...

Explanation:

(a) #include <stdio.h>

(b) int main( )

(c) for (c=o,c<n,c++)

(d) printf("Enter % d integers /n",n)

(e) printf ("Enter number of elements /n")

(f) scanf ("%d",Sn)

I hope it will right...

And if will right... I hope it will help you.....

Answer 2

mark brilliant friend i always help you

Answer:

O(log n) Worst-case space complexity. O(1) In computer science, binary search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position of a target value within a sorted array. Binary search compares the target value to the middle element of the array.

Explanation: