IB 10 Fisher

Yates algorithm 1. Create array A of elements. 2. For each element in A starting from the last element, calculate a random integer r between 0 and the current index i. 3. Swap the element at index i with the element at index r. 4. Decrement the current index i by one. 5. Repeat steps 2, 3, and 4 until the i=0. 6. At the end of this process, the elements in array A have been shuffled randomly. 7. Calculate a random integer s between 0 and the last index i of array A. 8. Swap the first element of array A with the element at index s. 9. Increment the current index i by one. 10. Repeat steps 7, 8, and 9 until the i=last index of array A.