CS-460-1.Fall-2005:Homeworks

Homework assignments for CS 460

[edit] Due Oct 1

Create 4 or 5 programs on binary trees and lists to illustrate and exercise the Oz features discussed.

Create a homework solutions page for yourself in this namespace. (Recall that to create a page called PageX in this namespace, refer to it as [[{{NAMESPACE}}:PageX | visible text]].
- Note that you type the literal characters {{NAMESPACE}}: as part of the link.
- Organize your homework page the same way this page is organized, i.e., with a separate section for each week's homework, most recent first.
- Note that pages are timestamped when they are created or modified. If one person copies from another, it will be easy to see whose page was created first.

Consider a non-recursive merge-sort.

Convert the original list [e f c b d a] into a list of singleton lists [[e] [f] [c] [b] [d] [a]].
Merge pairs of lists to get [[e f] [b c] [a d]]
Repeat the pair merge process until only one sublist is left:
1. [[b c e f] [a d]]
2. [[a b c d e f]]
3. [a b c d e f]

Write your version of this.

Implement 5 other recursive methods from the List module. Select at least two for which an argument is a function or a procedure.

Please don't use any of the built-in loop constructs. You may define your own For or other loop procedures and then use them.