冒泡排序 private static void MaoPao() { int[] arr=new int[7]{5,4,2,6,3,9,8}; int temp=0; for (int i = 0; i < arr.Length - 1; i++) { for (int j = i+1; j < arr.Length; j++) // j=i+1 重要 { if (arr[i] > arr[j]) //比较 大的数交换到后面 { temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; } } } for (int k = 0; k < arr.Length; k++) //循环输出 { Console.WriteLine(arr[k]); } } 插入排序 private static void charu() { int[] arr = new int[7] { 5, 4, 2, 6, 3, 9, 8 }; int temp, j; for (int i = 1; i < arr.Length; i++) { temp = arr[i]; for (j = i; j > 0 && arr[j - 1] > temp; j--) { arr[j] = arr[j - 1]; } arr[j] = temp; } for (int k = 0; k < arr.Length; k++) //循环输出 { Console.WriteLine(arr[k]); } }