Why not use one of the predefined sorts?
What are the records - colon delinated data?
Sorted on what type of critiria?
Sounds like you should RTFM on Alrogithm.h and the STL.
Merge-sort (a.k.a. quick sort) would be the best option. The idea being that one element is already sorted, so you devide the list recursivly into halves, and then reassemble it in order. O(n lg n)
Although if you have clockcycles to spare, you may want to start out with a bubble sort or other quadratic sort.
What KIND of sort are looking for?