A frog has to cross a road to meet its beloved she-frog at the other end. The road however has cars coming and can crush the frog.
Road is two lanes wide. Devise an algorithm to help the frog carry on its family. (I am sorry but it seems that I have missed some parts of the problem here. If someone remembers the complete question, please help me). Thanks in advance! -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
