1.选择排序
//选择排序 每次循环 依次与第一个数进行比较
for (int i = 0; i < arry.Length; i++)
{
for (int j = i+1; j < arry.Length; j++)
{
if (arry[i]>arry[j])
{
int temp = 0;
temp = arry[i];
arry[i] = arry[j];
arry[j] = temp;
}
}
}
2.冒泡排序
int [] nums = { 1,5,6,2,8,8,74,4};
//冒泡排序
int temp = 0;
for (int i = 0; i < nums.Length; i++)
{
for (int j = 0; j < nums.Length-1-i; j++)
{
if (nums[j]>nums[j+1])
{