CS 341 - Principles of Programming Languages Homework #13

Due: at the beginning of class 28

Note: This work is to be done in pairs.  Although you may divide the work, both team members should be able to present/describe their partner's work upon request. 

Implement the 6 algorithms of http://cs.gettysburg.edu/~tneller/cs341/hw1.html in Rust.  Be sure that you are reading from the standard input and writing to the standard output.  Name your Rust executable files as follows:

• maximum
• factorial
• unique
• quicksort
• bst
• bfs

These will be evaluated during class 28. There will be no late work accepted.

Rubric:

• maximum, factorial, unique, quicksort - 3 points each
• bst, bfs - 4 points each