//冒泡排序 public static int[] Bubbling(int[] s) { int a; for (int i = 0; i < s.Length-1; i++) { for (int j =i+ 1; j < s.Length; j++) { if (s[i] >s[j]) { a = s[j]; s[j] = s[i]; s[i] = a; } } } return s; }
转载于:https://www.cnblogs.com/Connaughtyu/p/9448850.html
相关资源：C# 冒泡排序法对输入的数字进行排序
