Shuffle the elements of any array most efficient way Fisher Yates Algorithm

You are given an array of N elements, shuffle elements of this array in such a way that, occurance of any element at any position is equally likely.

We'll use Fisher Yates Algorithm to solve this problem.