HW 5: Intro to Grammars and Syntax

- Write selection sort in ML as discussed in class. Remember the
recursive specification for this algorithm:
- An empty list is already sorted
- For a non-empty list, the sorted list is the smallest element in the list followed by a sorted version of the other elements in the list.

**E-mail your selection sort code to me before class, and bring hardcopy to class.** - Read Webber chapter 2 and do the Chapter 2 exercises below:
- #1 (b),(c),(e),(j)
- #2 (b),(c),(e),(j)