sorting algorithm: what changed
Revision 0 to 1. Removed lines have a minus sign; added lines have a plus sign.
Title: sorting algorithm
| Old | New | Line | |
|---|---|---|---|
| 1 | + | A **sorting algorithm** is a finite sequence of steps required to put a series of sortable objects into a sorted order. | |
| 2 | + | ||
| 3 | + | ## Generic Methods | |
| 4 | + | ||
| 5 | + | Generic algorithms include | |
| 6 | + | ||
| 7 | + | - [[Smoothsort]], | |
| 8 | + | - [[Radix sort]], | |
| 9 | + | - [[Shell sort]], and | |
| 10 | + | - [[Bubble sort]]. | |
| 11 | + | ||
| 12 | + | ## Targeted Implementation | |
| 13 | + | ||
| 14 | + | 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: | |
| 15 | + | ||
| 16 | + | - [[Array sort]] (arrays of comparable objects) | |
| 17 | + | - [[Counting sort]] (integers) | |
| 18 | + | - [[NaturalSort]] (strings) | |
| 19 | + | ||
| 20 | + | ## Choosing a Sorting Algorithm | |
| 21 | + | ||
| 22 | + | When choosing a sorting algorithm, you should know what purpose it is selected for and under what operating conditions it is used. | |
| 23 | + | ||
| 24 | + | ## see also | |
| 25 | + | ||
| 26 | + | - [[FGL]] – the Free Generics Libray – provides templates for collections that can be sorted, without re-inventing the wheel | |
| 27 | + | ||
| 28 | + | --- | |
| 29 | + | *From the Free Pascal wiki, page "sorting algorithm", as it stood on 2021-01-30 after a change by Jwdietrich, out of the wiki's dump of 2024-05-26. Copyright stays with the author who wrote it, according to the old wiki's [[Licensing]] page. If you have concerns about this material, [message the admin](/wiki-contact).* |