500 100,000 50000

BigO(n)

Miliseconds: 1.600

Comparrisons: 0

Array swaps: 50000

How do you scramble an array?

This particular scrambling algorithm simply iterates down the array and swaps a random element into the i'th position before moving onto the next element. This scrambling algorithm is linear(scaling factor of N) but is dependent on the 'randomness' of the random function used.
X
Merge Sort
Quick Sort
System Sort
Insertion Sort
Bubble Sort