pub fn tower_of_hanoi(n: u32, src: char, dest: char, aux: char)Expand description
A recursive implementation of the Tower of Hanoi solution that runs in O(2^n) time. This algorithm works by breaking the problem set into source, auxiliary, and destination pegs.