There are many standard algorithms for sorting data.  Some work well for small data sets, others are better for much larger data sets.

Some of the best known sorting algorithms include:

• Bubble Sort
• Insertion Sort
• Merge Sort
• Quick Sort

Some sorting algorithms employ a divide and conquer approach, and perform the same set of operations on successively smaller portions of the same set of data.  Such algorithms lend themselves to recursive implementation code, that is, programs that call themselves.