Sorting Algorithm Description--Alphabetical

1.  Alphabetize this list--Birch, Lorraine, Jeremy, Rebecca, Braden
2.  Is the list alphabetically sorted?
3.  If yes, skip to step 19.
4.  If no, continue to step 5.
5.  Compare Birch to Lorraine
6.  Birch comes before Lorraine so leave it alone.
7.  Compare Jeremy to Lorraine
8.  Jeremy comes before Lorraine, so put it before Lorraine and after Birch.
9.  Compare Rebecca to Lorraine
10. Rebecca comes after Lorraine so leave it alone.
11. Compare Braden with Rebecca
12. Braden comes before Rebecca, so put it before Rebecca.
13. Compare Braden with Lorraine
14. Braden comes before Lorraine, so put it before Lorraine.
15. Compare Braden with Jeremy
16. Braden comes before Jeremy, so put it before Jeremy.
17. Compare Braden with Birch
18. Braden comes after Birch so leave it alone.
19.  Write out the list in alphabetical order.