C#冒泡排序--详解

 1       int[] a = { 2, 45, 34, 22, 9, 78, 67, 98 };
 2             for (int i = 0; i < a.Length-1; i++)
 3             {
 4                 for (int j = 0; j < a.Length-i-1; j++)
 5                 {
 6                     if (a[j]>a[j+1])
 7                     {
 8                         int tmp = a[j];
 9                         a[j] = a[j +1];
10                         a[j +1] = tmp;
11                         
12                     }
13                 }
14             }
15             Console.WriteLine(string.Join("|",a));
16             Console.ReadKey();