Whats the syntax of binary search?

Answer 1

Binary search takes a sorted list and finds where a number/word is located in that list. Its called binary search because each time a search is done the nunber of items remaining to search is cut in 1/2.

I will represent where is being searched with a | symbol. Take the following list:

search for the number 20:

1 2 3 7 8 11 | 15 20 21 22 30 35 <---- 20 bigger

15 20 21| 22 30 35 <---- 20 smaller

15 | 20 21 <---- 20 found

In general this search operates on O(Log2 N) where N is the length of the list

Answer 2

its long so i cant write it here. but if u know the concept then u can do it.

Answer 3

should i tell concept.

Answer 4

man just see them there are many of them in sololearn code section

Answer 5

tell me

Answer 6

just tell me the program body

Answer 7

Please google these sort of questions.