八大排序C#

1. 冒泡排序
   $$平均时间复杂度O(n^2)$$

   public static int[] BubbleSort(int[] Array){
        
       for(int i = 1;i<Array.Length-1;i++){
        
           for(int j = 0;j<Array.Length-i-1;j++){
        
               if(Array[j]>Array[j+1]){
        
                   int temple = Array[j];
                   Array[j] = Array[j+1];
                   Array[j+1] = temple;
               }
           }
       }
       return Array;
   }
   

2. 快速排序
   $$平均时间复杂度O(nlog₂n)$$

   public static int[] QuickSort(int[] Array,int left,int right){
        
       if(left < right){
        
           int MiddleValue = Array[(left+right)/2];
           int i = left - 1;
           int j = right + 1;
           while(true){
        
               while(Array[++i] < MiddleValue && i < right);
               while(Array[--j] > MiddleValue && j > left);
               if(i >= j){
        
                   break;
               }
               else{
        
                   int temple = Array[i];
                   Array[i] = Array[j];
                   Array[j] = temple;
               }
               
           }
           QuickSort(Array,left,i-1);
           QuickSort(Array,j+1,right);
       }
       return Array;
   }
   

3. 选择排序