History of Sorting algorithm

Difference (from prior major revision) (minor diff, author diff)

Changed: 1,13c1

A sorting algorithm is an algorithm that puts elements of a list into order. Efficient sorting is important to optimizing the use of other algorithms (such as search algorithms) that operate best on sorted lists.

Many common sorting algorithms are used in computer science. They vary in computational complexity and in usage of memory and other computer resources.

Some sorting algorithms are:
*Bubble sort
*Insertion sort
*[Shell sort]?
*Quicksort
*Merge sort
*[Counting sort]?
*[Bucket sort]?
*Radix sort

#REDIRECT Sort algorithm

	Revision 5 . . (edit) October 4, 2001 9:11 am by BlckKnght [I can't capitalize properly...]
	Revision 4 . . (edit) October 4, 2001 9:10 am by BlckKnght [redirecting to [[Sort algorithm]]]
	Revision 3 . . September 26, 2001 6:46 pm by Drj [+heap sort, and sorted list!]
	Revision 2 . . September 25, 2001 5:32 pm by BlckKnght [added new sorts to list]
	Revision 1 . . September 25, 2001 8:26 am by BlckKnght [moving to properly capitalized title]