§16.11. Sorting
The three ways to sort a table correspond loosely to the three different orders in which tables can be repeated through. First:
sort (table name) in random order
This phrase rearranges the rows of the given table so that the non-blank rows occur at the top, in a uniformly random order, and any blank rows at the bottom. Example:
sort the Table of Recent Monarchs in random order;
Secondly:
sort (table name) in (table column) order
This phrase rearranges the rows of the given table so that the non-blank rows occur at the top, so that the given column has ascending order, and any blank rows at the bottom. Example:
sort the Table of Recent Monarchs in accession order;
Ascending order means 1 up to 10, say, or A up to Z, with blank values coming last.
sort (table name) in reverse (table column) order
This phrase rearranges the rows of the given table so that the non-blank rows occur at the top, so that the given column has descending order, and any blank rows at the bottom. Example:
sort the Table of Recent Monarchs in reverse name order;
Descending order means 10 down to 1, say, or Z down to A, with blank values coming last.
Note that blank values will always be placed below non-blank ones, and entirely blank rows last of all. This is true even if we use "reverse".
The method of sorting is "stable", that is, if two rows have the same value then they will stay the same way round in the sorted table, rather than being swapped over. For example, if we sort this into reverse index order:
Index | Comment |
1 | "Originally row 1" |
2 | "Originally row 2" |
2 | "Originally row 3" |
3 | "Originally row 4" |
then we get
Index | Comment |
3 | "Originally row 4" |
2 | "Originally row 2" |
2 | "Originally row 3" |
1 | "Originally row 1" |
As a result note that repeating through this sorted table goes through the original rows in order 4, 2, 3, 1; whereas repeating through the original table in reverse order goes through in order 4, 3, 2, 1. (This is all to explain the word "loosely" in the opening sentence of this section.)
Suppose we want a deck of cards which the player can shuffle and draw from. Our first (rather tedious) task is merely to set up the deck as a table:
We're going to describe the higher numbers as face cards, so it helps to write a new "to say" phrase.
Now we get the shuffling of the deck from "sort in random order", so:
This will continue to work properly even as the deck is partially depleted. Speaking of which, suppose we want the player to be able to toss the cards one-by-one into a hat. They are going to need to be removed from the deck, so:
If we wanted to simulate a slightly more stimulating game, we could instead have a second table to represent the player's hand of cards and record each card drawn. That would get long for the purposes of example, however, so instead we will just admit that the player's life is an empty husk of existence:
|
|
Suppose we want a deck of cards which the player can shuffle and draw from. Our first (rather tedious) task is merely to set up the deck as a table:
We're going to describe the higher numbers as face cards, so it helps to write a new "to say" phrase.
Now we get the shuffling of the deck from "sort in random order", so:
This will continue to work properly even as the deck is partially depleted. Speaking of which, suppose we want the player to be able to toss the cards one-by-one into a hat. They are going to need to be removed from the deck, so:
If we wanted to simulate a slightly more stimulating game, we could instead have a second table to represent the player's hand of cards and record each card drawn. That would get long for the purposes of example, however, so instead we will just admit that the player's life is an empty husk of existence:
Suppose we want a deck of cards which the player can shuffle and draw from. Our first (rather tedious) task is merely to set up the deck as a table:
We're going to describe the higher numbers as face cards, so it helps to write a new "to say" phrase.
Now we get the shuffling of the deck from "sort in random order", so:
This will continue to work properly even as the deck is partially depleted. Speaking of which, suppose we want the player to be able to toss the cards one-by-one into a hat. They are going to need to be removed from the deck, so:
If we wanted to simulate a slightly more stimulating game, we could instead have a second table to represent the player's hand of cards and record each card drawn. That would get long for the purposes of example, however, so instead we will just admit that the player's life is an empty husk of existence:
|