无序排列/随机化数组

Posted 2021-02-24

This method shuffles an array. This is the optimum implementation for such an algorithm - O(n).

public  static void Shuffle<T>(T[] array)
    {
        Random random = new Random();
 
        for (int i = 0; i < 10; i++)
        {
            int idx = random.Next(i, 10);
 
            //swap elements
            T tmp = array[i];
            array[i] = array[idx];
            array[idx] = tmp;
        }  
    }