30 lines
1.3 KiB
Plaintext
30 lines
1.3 KiB
Plaintext
{{Sorting Algorithm}}
|
||
[[Category:Sorting]]
|
||
|
||
When sorting records in a table by a particular column or field, a [[wp:Stable_sort#Stability|stable sort]] will always retain the relative order of records that have the same key.
|
||
|
||
|
||
;Example:
|
||
In this table of countries and cities, a stable sort on the ''second'' column, the cities, would keep the '''US Birmingham''' above the '''UK Birmingham'''.
|
||
|
||
(Although an unstable sort ''might'', in this case, place the '''US Birmingham''' above the '''UK Birmingham''', a stable sort routine would ''guarantee'' it).
|
||
|
||
<pre>
|
||
UK London
|
||
US New York
|
||
US Birmingham
|
||
UK Birmingham
|
||
</pre>
|
||
|
||
Similarly, stable sorting on just the first column would generate '''UK London''' as the first item and '''US Birmingham''' as the last item (since the order of the elements having the same first word – '''UK''' or '''US''' – would be maintained).
|
||
|
||
|
||
;Task:
|
||
:# Examine the documentation on any in-built sort routines supplied by a language.
|
||
:# Indicate if an in-built routine is supplied
|
||
:# If supplied, indicate whether or not the in-built routine is stable.
|
||
|
||
<br>
|
||
(This [[wp:Stable_sort#Comparison_of_algorithms|Wikipedia table]] shows the stability of some common sort routines).
|
||
<br><br>
|