After the presentation Algorithm development you should be able to:

STEP 1: Problem description: Jeroo 1 starts out at 0,0 with a single flower. Jeroo 2 starts out with a single flower somewhere in the same column as Jeroo 1. There is one net on the island directly to the East of Jeroo 2. Direct Jeroo 1 to give its flower to Jeroo 2 . Then, Jeroo 2 must disable the net by tossing the flower on it, plant a flower in its place and move off of the flower. ** What is missing in this problem description? ** see diagrams below and fill in missing information for step 1.

STEP 2: Analysis: diagram the problem (fill in below)

Starting positions Ending positions
Jeroo 1 (facing north initially)
Jeroo 2 (facing east initially)

STEP 3: Write the high-level algorithm








STEP 4: Write the detailed algorithm

STEP 5: Review of solution: