Insertion sort is a method that you probably would use already. The general idea is to designate one section of data as already sorted, then look at each of the unsorted items one at a time and insert it into the sorted list.
http://www.sorting-algorithms.com
- Start at one end of the list.
- Traverse the list to the end.
- Work back to the front of the list to find where the item should go.