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
- 21850 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
stripos — Find position of first occurrence of a case- insensitive string int stripos ( char* haystack, char* needle, int offset ) Returns the numeric position of the first occurrence of needle in the haystack string. Note that the needle may be a string of one or more characters. If needle is not found, stripos() will return -1. The function should not make use of any C library function calls.
What is auto keyword in c?
What are control structures? What are the different types?
What are enumerated types?
What is #ifdef ? What is its application?
What are multibyte characters?
What is the right type to use for boolean values in c?
Explain the difference between the local variable and global variable in c?
What is the condition that is applied with ?: Operator?
What is pass by value in c?
What is the difference between printf and scanf in c?
Write a program of prime number using recursion.
Write the control statements in C language
What is the ANSI C Standard?
Why is c called "mother" language?
