We(?) will define Standard Young Tableaux and the RSK algorithm between pairs of Young Tableau of the same shape and permutations, paying particular attention to filling in the details of the sketch of a visual proof of the algorithm's bijectivity found in Stanley's "Enumerative Combinatorics, Volume 2". We will also discuss how the algorithm relates to the canonical importance of the seemingly-arbitrarily-defined concepts of Young diagrams and Schur functions.