Vamsi Pavan’s Place

When curiousity outbursts …..

Paratroopers

May 14th, 2007 · No Comments · Puzzles

Question : Two paratroopers jump from a plane and land on an infinite straight line. They want to find each other. Arrive at an algorithm so that they meet in finite time. You can use only the following type of statements.
1. if (some condition)
2. while (some condition)
3. Go left
4. Go right
Remember that both are going to use exactly the same algorithm.

Answer : Sorry guys, I don’t know the answer. If you know, just post a comment. I can update here.

Bookmark it! These icons link to social bookmarking sites where readers can share and discover new web pages.
  • bodytext
  • Sphinn
  • del.icio.us
  • Facebook
  • Mixx
  • Google
  • Live
  • StumbleUpon
  • BlinkList
  • YahooMyWeb
  • NewsVine
  • blogtercimlap
  • Netvouz
  • Technorati
  • Slashdot
  • Print this article!

Tags:

0 responses so far ↓

  • There are no comments yet...Kick things off by filling out the form below.

Leave a Comment