Selection Sort
Sept. 8th '05

Start with an array.  5, 9, 4, 13, 1
Start going through the array looking for the smallest value. The startIndex would be a pointer towards there you start searching from. This is, at first 0, from there, find the smallest value. 

Compare 5 with 9, then with 4, then with 13, 
when you compare 5 with 4, 4 becomes the smallIndex

(Small Value is 4, small index is wherever "4" is in the array)

When you find the smallest, you put it in the first entry. Then you move the startIndex.