几个简单的排序算法

        //冒泡排序         public static void PopSort(int[] arry)         {             for (int i = 0; i < arry.Length-1; i++)             {                 for (int j = i; j < arry.Length-1; j++)                 {                     if (arry[i] > arry[j + 1])                     {                         int temp = 0;                         temp = arry[i]; arry[i] = arry[j + 1]; arry[j + 1] = temp;                     }                 }             }      ...