Description of a Soring Algorithm

1.  Input the list of 10 items and from the names of the 10 items to be sorted do the following:

2.  First, check the first letter of the first name of each item 
    in the list to check if they are in alphabetical order - A thru Z.

3.  If yes, skip to number 9.

4.  If no, continue to number 5.

5.  Then, compare the first letter of the first name in item 
    1 to the first letter of the first name in item 2, if the two
    items are in correct alphabetical order - A thru Z, leave them alone; 
    otherwise swap them.    

6.  Next, take the next successive item in the list and insert it into its 
    place by moving all items up one position and inserting it below the moved items.  

7.  Next compare the first letter of the first name in items 
    1, 2 and 3, and if the three items are in correct alphabetical order - A thru Z, 
    leave them alone; otherwise swap them in alphabetical order by moving the items
    up or down until all items are in alphabetical order - A thru Z.

8.  Continue in this way until all 10 items have been inserted in alphabetical order 
    - A thru Z - by moving the items up or down and inserting the added items in 
    the correct positions.
 
9.  Print the sorted list in alphabetical order by the first 
    letter of the first name in each item - A thru Z.

10.  End of procedure.