Write pseudo code of the algorithm to solve the following problem with minimum number of floor checking complexity (other logic which yields more floor will not be considered as the answer): “A firm wants to determine the highest floor of its n-story headquarters from which a gadget can fall without breaking. The firm has two identical gadgets to experiment with. If one of them gets broken, it cannot be repaired, and the experiment will have to be completed with the remaining gadget. Design an algorithm in the best efficiency class you can to solve this problem.” A prototype of the algorithm is given as: int checkHeight(Building[1..n], W1, W2) //Building with 1 to n floors and two weights w1, w2, and it will return the highest //floor number from which the weight can fall safely. Whenever, you throw a weight, //it will either break or do not break with a function ThrowWeight(FloorNo, W) //It will return 1 if the weight does not break and 0 if it breaks.
Write pseudo code of the
“A firm wants to determine the highest floor of its n-story headquarters from which a gadget can fall without breaking. The firm has two identical gadgets to experiment with. If one of them gets broken, it cannot be repaired, and the experiment will have to be completed with the remaining gadget. Design an algorithm in the best efficiency class you can to solve this problem.” A prototype of the algorithm is given as:
int checkHeight(Building[1..n], W1, W2)
//Building with 1 to n floors and two weights w1, w2, and it will return the highest
//floor number from which the weight can fall safely. Whenever, you throw a weight,
//it will either break or do not break with a function ThrowWeight(FloorNo, W)
//It will return 1 if the weight does not break and 0 if it breaks.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
