A binary function is also known as a half-interval search is a search algorithm to find the position of a given element x within a well-sorted array [].
Binary search compares the target value to the middle element of the array.
It ignores half of the elements just after one comparison.
it compares x with the middle element.

So, the function read an element one time in the array before finding the value.

3 0

3 years ago

Yanka [14]

Answer:

The program in Python is as follows:

TotalCost = int(input("Total cost: "))

if TotalCost <= 2000:

print("Wall Clock")

elif TotalCost >= 2001 and TotalCost <= 5000:

print("School Bag")

elif TotalCost >= 5001 and TotalCost <= 10000:

print("Electric Iron")

else:

print("Wrist Watch")

Explanation:

This gets input for total cost

TotalCost = int(input("Total cost: "))

If the total cost is up to 2000, print wall clock as the assured gift

if TotalCost <= 2000:

print("Wall Clock")

If the total cost is between 2001 and 5000 (inclusive), print school bag as the assured gift

elif TotalCost >= 2001 and TotalCost <= 5000:

print("School Bag")

If the total cost is between 5001 and 10000 (inclusive), print electric iron as the assured gift

elif TotalCost >= 5001 and TotalCost <= 10000:

print("Electric Iron")

If the total cost is more than 10000, print wrist watch as the assured gift

else:

print("Wrist Watch")

8 0

3 years ago

Oksi-84 [34.3K]

I am pretty sure he would be the production manager

3 0

3 years ago