sorting algorithm
From Free Pascal wiki
Revision as of 08:31, 24 June 2020 by Kai Burghardt (talk | contribs) (structure page, rephrase definition of lemma)
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.
│
English (en) │
A sorting algorithm is a finite sequence of steps required to put a series of sortable objects into a sorted order.
generic methods
There are several different sorting algorithms. Some sorting algorithms include, for example,
- Smoothsort,
- Radix sort, and
- Bubble sort.
targeted implementation
Some sorting algorithms are tweaked based on the properties the provided objects have or other information about the set of objects. Following sorting algorithms are made for special purposes:
- Array sort (arrays of comparable objects)
- Counting sort (integers)
- NaturalSort (strings)
choosing a sorting algorithm
When choosing a sorting algorithm, you should know what purpose it is selected for and under what operating conditions it is used.
see also
- FGL – the Free Generics Libray – provides templates for collections that can be sorted, without re-inventing the wheel
