| Property | Value |
|---|---|
| Hex Value | $E4 |
| Categories | |
| Localizations |
|
SortD(
Overview
Sorts elements of listname in descending order.
Availability: Token available everywhere.
Syntax
SortD(listname)
Arguments
| Name | Type | Optional |
|---|---|---|
| listname | list |
Location
2nd, list, OPS, 2:SortD(
Overview
Sorts elements of keylistname in descending order, then sorts each dependlist as a dependent list.
Availability: Token available everywhere.
Syntax
SortD(keylistname,dependlist1[,dependlist2,..., dependlist n])
Arguments
| Name | Type | Optional |
|---|---|---|
| keylistname | list | |
| dependlist1 | list | |
| dependlist2 | list | Yes |
| dependlist n | list | Yes |
Location
2nd, list, OPS, 2:SortD(
Description
The SortD( command sorts a list in descending order. It does not return it, but instead edits the original list variable (so it takes only list variables as arguments).
SortD( can also be passed multiple lists. In this case, it will sort the first list, and reorder the others so that elements which had the same indices initially will continue having the same indices. For example, suppose the X and Y coordinates of some points were stored in ʟX and ʟY, so that the Nth point had coordinates ʟX(N) and ʟY(N). Then SortD(ʟX,ʟY) would sort the points by their x-coordinates, still preserving the same points.
However, SortD( is not stable: if several elements in the first list are equal, then the corresponding elements in the subsequent lists may still end up being in a different order than they were initially.
Algorithm
The algorithm used by SortD( and SortA( appears to be a modified selection sort. It is still O(n2) on all inputs, but for some reason takes twice as long on a list with all equal elements. It is not stable.
Related Commands
Source: parts of this page were written by the following TI|BD contributors: DarkerLine, GoVegan.
History
| Calculator | OS Version | Description |
|---|---|---|
| TI-82 | 1.0 | Added |