冒泡算法

class Program { static void Main(string[] args) { int[] array = { 1, 4, 5, 6, 7, 32, 54, 65, 76, 32, 34,524,65,85,59 }; for (int i = 0; i < array.Length; i++) { for (int j = 0; j < array.Length-1-i; j++) { if (array[j]>array[j+1]) { int temp = array[j]; array[j]=array[j+1]; array[j + 1] = temp; } } } for (int i = 0; i < array.Length; i++) { Console.WriteLine("从小到大是：{0}\n",array[i]); } Console.ReadKey(); } }

转载于:https://www.cnblogs.com/QQ765286788/p/4700109.html