Search for question

cannot be performed in a finite amount of time.

Suppose, says the ancient philosopher Zeno of Elea, that you are in the middle of a room and want to

get out. The door is 20m away, is open, and nothing is blocking your path. Go ahead and walk to the

door-except there is a tiny problem. To get there, you must walk halfway to the door, then halfway

from the point where you previously stopped. You need to keep repeating this until you reach the door.

Assume it takes a constant time, say 10 seconds, each time you get to the halfway point, regardless of

the distance covered. That is, to cover the first 10m, it takes 10 seconds, for the next 5m it also takes 10

seconds, and so on. How long would it take before you reach the door? Write a Java program to justify

your answer. Provide a brief discussion.

Fig: 1