Random Permutation

Given an array of $n$ distinct elements, generate a uniformly random permutation — every one of the $n!$ orderings must be equally likely. You have access to a function randint(a, b) returning a uniform integer in $[a,b]$.

Describe an algorithm and prove it is uniform.