This page displays the classical Robinson-Schensted algorithm.  It is included here because it is an ingredient to two of the algorithms, as well as a precurser to the Domino Robinson-Schensted algorithm, which is an ingredient to the rest of the algorithms.  The input to the Robinson-Schensted algorithm is a permutation, for example, 2 5 3 6 4 1.  The output is a pair of tableaux.  (To see the algorithms which use the Robinson-Schensted algorithm, go to SU(p,q) Algorithm and SU*(2n) Algorithm.)

The page can be used in two ways.  First, you can have the page generate a random permutation.  To do that, enter the size of the desired permutation in the first textbox.  Then click one of the two buttons directly to the right.  The Run button will display a randomly-generated permutation and the output of the Robinson-Schensted algorithm when applied to that permutation.  Alternatively, the Run Steps button will also generate a random permutation, and will show you the intermediate steps of applying the Robinson-Schensted algorithm to that permutation.

Instead, you can enter a permutation in the second textbox.  To do that, list the numbers of the permutation, separated by spaces.  Then, use the Run or Run Steps buttons to the right of that box, as above.

Pressing Enter while in one of these two textboxes will click the Run button to the right.  Pressing a button a second time, or a different button, will clear the previous result as it gives you a new result, as will pressing Enter while in a textbox.

To see animations of the insertion (or bumping) procedure of the Robinson-Schensted algorithm, go to Robinson-Schensted Algorithm Animated.