I don’t think so. Not sure though
C vraiment très facile
Si tu a besoin d’aide recontacter moi
D size
Read more
Hope,this helped
Answer:
d. It is assumed that the search pool is ordered.
Explanation:
A binary search/logarithimic search/half interval search/binary chop refers to search algorithm in computer science that sorts data in array in key:value arrangements. In order to locate a value in binary search, the key to the value in a sorted array is located. A binary search is characterized by an ascending, descending order arrangement of the array.
Answer:
I'll be using python:
__________________________
a=int(input("Enter a number :"))
b=int(input("Enter another number :"))
c=int(input("Enter last number :"))
lis=[a,b,c]
sort=sorted(lis)
print("The largest number is:", sort[1])
___________________________
