TI-BASIC:Sortd

From Learn @ Cemetech
Revision as of 18:25, 24 February 2016 by Maintenance script (talk | contribs) (Initial automated import)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigationJump to search

SORTD.GIF

Command Summary

Sorts a list in descending order.

For more than one list, sorts the first, and reorders other lists accordingly.

Command Syntax

SortD(list1 [,list2, ...])

Menu Location

Press:

  1. 2nd LIST to access the list menu.
  2. RIGHT to access the OPS submenu.
  3. 2 to select SortD(, or use arrows and ENTER.

Calculator Compatibility

TI-83/84/+/SE

Token Size

1 byte

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(n^^2^^) on all inputs, but for some reason takes twice as long on a list with all equal elements. It is not stable.

Related Commands