In this page, I'm going to show you the permutation-capabilities of Recursion.
Permutation means a combination of certain units in all possible orderings.
Recursion can be effectively used to find all possible combinations of a given set of elements. This has applications in anagrams, scheduling and, of course, Magic Squares. And if you're interested, Recursion can also be used for cracking passwords. A magic square is a 'matrix' or a 2-dimensional grid of numbers. Take the simple case of a 3x3 magic square.