1、数组的冒泡排序:
int[] nums = new int[] { 98, 54, 322, 43, 23 };
int temp = 0;
for (int j = 0; j < nums.Length - 1; j++)
{
for (int i = 0; i < nums.Length-1-j; i++)
{
if (nums[i]>nums[i+1]) // >是从小到大排序;<是从大到小排序
{
temp = nums[i];
nums[i] = nums[i + 1];
nums[i + 1] = temp;
}
}
}
for (int i = 0; i < nums.Length; i++)
{
Console.WriteLine(nums[i]+"\t");
}
Console.ReadKey();
2、反转语句:
Array.Reverse(nums);
for (int i = length - 1; i >= 0; i--);
//正常排序
int[] nums = new int[] { 2, 13, 45