At the end of this lesson you will know how to create a large
program.
1. Print and read the lesson. (Punch, staple, put in your binder.)
2. Run each of the demos, flowcharts or other materials from the lesson.
sequential search1, sequential
search2
A better search is the binary search:
the binary search cannot be used in this program because the array is not in
alphabetical order.
3. Write each of the programs in the lesson. To get the most out of these programs
4. Compare the code in the programs to the ones you wrote.
step1, step2,
step3, step4,
step5, step6,
step7
The lesson also refers to the shape program.
5. Using the sample programs as a model, write a completly new program that uses the same techniques.