The RSK algorithm gives a beautiful bijection between the symmetric group S_n and pairs of young tableaux with the same shape. In this interactive talk we will see several ways to implement the algorithm, from patience sorting to growth diagrams to geometric constructions. There will be lots of examples (and maybe a little representation theory).