CS 1120
			L. Lilien
------------------------------------------------------------------------------------
        (Simple) Recursion Self-evaluation Exercise 1

Develop a program that calculates _recursively_ the sum of the first n integers (1+2+ ... + n).
------------------------------------------------------------------------------------

------------------------------------------------------------------------------------
        (More Challenging) Recursion Self-evaluation Exercise 2

Develop a program that _recursively_ sorts a set of n (nonconsecutive) integers.
Hint: Base case (termination condition) ocurs when set size is 1 (set of size 1 is trivially sorted).
------------------------------------------------------------------------------------