//预排序的数组 int[,] myIntArray = new int[xxx,yyy];//排序后的整数 IList<int> intList = new List<int>();//排序过程 foreach (int i in myIntArray) { if (intList.Count == 0) { intList.Add(i); continue; } int intListCount = intList.Count; for (int index = 0; index < intList.Count; index ++) { if (intList[index] > i) { intList.Insert(index, i); break; } } if (intListCount == intList.Count) { intList.Add(i); } }
用一个1维的保存,然后再排序不就行了=====================================简明 扼要 佩服
Random r = new Random();
int[,] aa = new int[10,10];
for(int i=0;i<10;i++)
{
for(int j=0;j<10;j++){
aa[i,j]=r.Next(100);
}
} for(int i=0;i<10;i++)
{
for(int j=0;j<10;j++)
{
System.Diagnostics.Debug.Write("aa[" + i.ToString() + "," + j.ToString() + "]=" + aa[i,j].ToString() + " "); }
System.Diagnostics.Debug.WriteLine("");
} int temp;
for(int i=0;i<10;i++)
{
for(int j=0;j<10;j++)
{
for(int m=0;m<j;m++)
{
if(aa[i,j]<aa[i,m])
{
temp = aa[i,j];
aa[i,j]=aa[i,m];
aa[i,m]=temp;
}
}
}
} for(int i=0;i<10;i++)
{
for(int j=0;j<10;j++)
{
System.Diagnostics.Debug.Write("aa[" + i.ToString() + "," + j.ToString() + "]=" + aa[i,j].ToString() + " "); }
System.Diagnostics.Debug.WriteLine("");
}
int[,] myIntArray = new int[xxx,yyy];//排序后的整数
IList<int> intList = new List<int>();//排序过程
foreach (int i in myIntArray)
{
if (intList.Count == 0)
{
intList.Add(i);
continue;
} int intListCount = intList.Count;
for (int index = 0; index < intList.Count; index ++)
{
if (intList[index] > i)
{
intList.Insert(index, i);
break;
}
} if (intListCount == intList.Count)
{
intList.Add(i);
}
}