冒泡排序

#region  数组 最大值 最小值 平均值 求和 冒泡排序        

     int[] arrag = new int[5] { 31, 62, 83, 54, 85 };             for (int i = 0; i < 5; i++)             {                 for (int j = i + 1; j < 5; j++)                 {                     if (arrag[i] > arrag[j])                     {

                        int myarrag;                         myarrag = arrag[i];                         arrag[i] = arrag[j];                         arrag[j] = myarrag;                     }                 }                 Console.Write(arrag[i]);             }             Console.ReadKey();             //    int sum = 0;             //    int min;             //    int max;             //    max = arrag[0];             //    min = arrag[arrag.Length - 1];             //    Console.Write(max + "\n");             //    Console.Write(min + "\n");             //    for (int i = 0; i < 5; i++)             //    {             //        sum += arrag[i];             //    }             //    Console.WriteLine(sum);             //    int avg;             //    avg = sum / arrag.Length;             //    Console.WriteLine(avg);             //    for (int i = 0; i < 5; i++)             //    {             //        Console.WriteLine(arrag[i]);             //    }

            //    Console.ReadKey();             #endregion