There is a 100-story building and you are given two eggs.
The eggs (and the building) have an interesting property
that if you throw the egg from a floor number less than X,
it will not break. And it will always brake if the floor
number is equal or greater than X. Assuming that you can
reuse the eggs which didn't broke; you got to find X in a
minimal number of throws. Give an algorithm to find X in
minimal number of throws.
- 5 Answers
- 21406 Views
- Yahoo, I also Faced
- E-Mail Answers
Answer Posted / the practitioner
Just start on the first floor and throw the egg. If it
breaks then X=1
If not then go to the second floor and throw the egg. If it
breaks then X=2
If not then go to the third floor and throw the egg. If it
breaks then X=3
If not then keep doing that and the floor it breaks on is
the floor that X equals.
But really, in real life, a real egg would break from 3
feet.
| Is This Answer Correct ? | 0 Yes | 31 No |
Post New Answer View All Answers
What is a keyword?
Explain how do you list a file’s date and time?
Explain how can I read and write comma-delimited text?
a linearly ordered set of data elements that have the same structure and whose order is preserved in storage by using sequential allocation a) circular b) ordinary c) array d) linear list
What is echo in c programming?
Write a program to implement queue.
Can we assign integer value to char in c?
What is structure packing in c?
State the difference between realloc and free.
Write a code of a general series where the next element is the sum of last k terms.
What are the uses of null pointers?
Why functions are used in c?
What is c basic?
What does 4d mean in c?
What are local static variables? How can you use them?
