[Skip Links]
Sorting:
[Front Door]
[Syllabus]
[Standard Sorting Algorithms]
[Lab Manual (PDF)]
Exercises:
[PBJ]
[PBJ2]
[Sorting CDs]
[Sorting Numbers]
[Starting Scheme]
[Comparing Algorithms]
[Selection Sort]
[Formalizing Requirements]
[Comparing Sorts]
[Finding the Largest]
Glimmer/Education:
[Glimmer Labs]
[SchemeWeb]
[ScriptFu For Schemers]
[CS Education]
Glimmer Labs
Given your experience of dealing with a simulated clueless person, write a set of instructions for making N peanut butter and jelly sandwichs, where N is a non-negative integer. That is, the person should be able to follow these instructions to make 1, 10, 5, or even 0 sandwiches. You can assume that the person has enough supplies to make N sandwiches and that the person can count.
This document was generated by
Siteweaver on Fri Sep 10 10:16:21 2004.
The source to the document was last modified on Tue Aug 20 10:36:18 2002.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Glimmer/Sorting/pbj2.html.
You may wish to
validate this document's HTML
;
;
Check with Bobby