Difference between revisions of "sorting algorithm"
From Lazarus wiki
Jump to navigationJump to searchJwdietrich (talk | contribs) (Improving language and grammar) |
Jwdietrich (talk | contribs) |
||
| Line 4: | Line 4: | ||
__NOTOC__ | __NOTOC__ | ||
| − | |||
== Generic Methods == | == Generic Methods == | ||
Generic algorithms include | Generic algorithms include | ||
Latest revision as of 19:16, 30 January 2021
│
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
Generic algorithms include
- Smoothsort,
- Radix sort,
- Shell sort, and
- Bubble sort.
Targeted Implementation
Some sorting algorithms are tweaked based on properties the provided objects have or other information about the set of objects. The 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
