You are given 2 eggs.
* You have access to a 100-storey building.
* Eggs may break if dropped from the first floor or may not even break if dropped from 100 th floor.
* Both eggs are identical.
* You need to figure out the highest floor of a 100-storey building an egg can be dropped without breaking.
* Now the question is how many drops you need to make. Remember you are allowed to break only 2 eggs in the process
Note: I want the max no. of drops required when the "most efficient" (algorithmic sense) way is adopted or jst give the way/algorithm.
(+2 pts)
* You have access to a 100-storey building.
* Eggs may break if dropped from the first floor or may not even break if dropped from 100 th floor.
* Both eggs are identical.
* You need to figure out the highest floor of a 100-storey building an egg can be dropped without breaking.
* Now the question is how many drops you need to make. Remember you are allowed to break only 2 eggs in the process
Note: I want the max no. of drops required when the "most efficient" (algorithmic sense) way is adopted or jst give the way/algorithm.
(+2 pts)
2. 
3.
(+1 point)
