随机分配算法

1

int[] a = { 1, 2, 4, 5, 3, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 };
            int[] rnd = { -1, 0, 1 };
            Array.Sort(a, (i, j) => { if (i == j) return 0; return rnd[new Random(Guid.NewGuid().GetHashCode()).Next(0, 3)]; });

2

                var arr:Array = [1, 2, 3, 4, 5];
                arr = randomArr(arr);
                /** 随机排列数组里的顺序 */
                function randomArr(arr:Array):Array
                {
                        var _arr:Array = [];
                        var length:uint = arr.length;
                        for(var i:uint; i<length; i++)
                        {
                                var random:uint = Math.random() * arr.length;
                                _arr.push(arr.splice(random, 1));
                        }
                        return _arr;
                }

3

/** 随机排列数组里的顺序 */

function randomArr(arr:Array):Array {
        return arr.sort (function(){return Math.random ()>.5});

}