We have covered in other tutorials the bubble sort and sorting using a binary search tree. We describe them briefly here and provide links to the theory and to our demonstration programs. (Program Bogosort by Lewis provides a frivolous alternative). We introduce and provide demonstration code for the insertion sort and quicksort. Others to look out for include merge sort, Shell sort and radix sort.
Follow these links to the different methods of sorting.