求一乱序算法!

[zhanzhiyuan]

要求把数组中的顺序打乱。。越乱越好

[kirc]

private void 乱序算法()
{
int[] iarr = new int[10]{1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
Random r = new Random();
int pos, temp, lpos = 1;
for(int i=0; i<10; i++)
{
pos = r.Next(0, iarr.Length);
temp = iarr[pos];
iarr[pos] = iarr[lpos];
iarr[lpos] = temp;
lpos = pos;
}
}

[RexZheng]

关注

[copico]

int[] intD =new int[10]{1,2,3,4,5,6,7,8,9,10};

int i,j;
for(j=0 ;j<10000;j++) //让它在里面搅1000次
{
Random rnd1 =new Random(10);//这个10按你数组的大小来定
Random rnd2 = new Random(10);
int a ,b,temp;
a=(int)rnd1;
b=(int)rnd2;
temp=intD[rnd1];
intD[rnd1]=intD[rnd2];
intD[rnd2]=temp;
}

[viena]

怎样才算乱呢？数组本身就是乱的

[diandian82]

right,你没有一个乱的标准，万一乱完了正好是你看来最整齐的怎么办？

[real3000]

public class RandomRange
{
private int range = 0;
private object[] container;
private Random rand;

public RandomRange(object[] container)
{
this.container = container;
this.range = container.Length;

long time = DateTime.Now.Ticks;
string temp = Convert.ToString(time,2).PadLeft(64,'0');
string temp2 = temp.Substring(32,32);
int i = Convert.ToInt32(temp2,2);
rand = new Random(Convert.ToInt32(temp2,2));
}

public void DoRange()
{
int j = 0;
for(int i=0;i<range;i++)
{
j = rand.Next(range);
Switch(i,j);
}
}

private void Switch(int i,int j)
{
int temp = 0;
temp = container[i];
container[i] = container[j];
container[j] = temp;
}

public override string ToString()
{
StringBuilder sb = new StringBuilder();
for(int i=0;i<range;i++)
{
sb.Append(container[i].ToString());
sb.Append(" ");
}
return sb.ToString();
}
}

[aSalt]

直接拉(哈)稀了得了~~绝对乱地你找不到北,但相当~~~便于~~~拉的人查找

hash