Planning for a complex program (ZigZagLakes)

1. Problem Description: Read the problem carefully, is anything ambiguous? unclear?
   1. Does the position of the first flower change on any of the islands?
   2. Does the position of the first net change on any of the islands?
   3. Will the second Jeroo always have enough flowers to break through all the nets?
2. Analysis: Look at the islands and be sure you understand where everything ends up when the program runs for each different island. Mark:
   1. Where do the Jeroos start? (mark a 1 and 2 on each map)
   2. Where will Jeroo #1 end up after picking the flowers? (mark F on each map)
   3. After giving flowers? (mark G on each map)
   4. Where will #2 end up? (mark N on each map)
   5. How will the islands have changed?
   6. Which way will each Jeroo be facing when it's ready to dance its celebration?
      
   
   
3. Break the problem description down into sections: (high level algorithm)
   • The first Jeroo should follow the trail of flowers around the lakes, going from the northwest to the southeast, picking each flower it finds along the way. It should stop after all flowers have been picked and pass them to the second Jeroo. The second Jeroo should then follow the trail of nets from the southeast to the northwest. This Jeroo will disable each net as it comes to it by tossing a flower on it, stopping at the shore. At the end of the program, the first Jeroo and second Jeroo should each do a spin (360-degree turn) to celebrate what they have accomplished.
4. Break the large parts into more detailed parts
   

   pickFlowers	giveFlowers	disableNets	dance
   do you need to find the flowers first? keep doing this: pick a row decide which way to turn	do you need to find the other jeroo first? keep giving flowers as long as the first jeroo still has some	do you need to find the nets first? keep doing this: pick a row decide which way to turn or if you should hop ahead	do you need to know which way each Jeroo will be facing? Turn 4 times how can the same method work for both Jeroos without repeated code?

5. Have you solved some of these before? Can some methods be used for both Jeroos? Should some methods be broken up into smaller methods?