sorting algorithm

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

---

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.