Basic sorting algorithm (C #)

        #regionAlgorithmStatic voidSelectionsorter ()//Select Sort        {            int[] List =New int[] {9,5,6, the,2,0, A,895,1,6 };  for(inti =0; I < list. Length-1; i++)            {                intMin =i;  for(intj = i +1; J < list. Length; J + +)                {                    if(List[j] <List[min]) {min=J; }                }                vart =List[i]; List[i]=List[min]; List[min]=T; }            foreach(varIteminchlist)            {Console.WriteLine (item); }        }        Static voidEbullitionsorter ()//Bubble Sort        {            int[] List =New int[] {9,5,6, the,2,0, A,895,1,6 };  for(inti =0; I < list. Length-1; i++)            {                 for(intj =0; J < list. Length-1I J + +)                {                    if(List[j +1] <List[j]) {                        intt = list[j +1]; List[j+1] =List[j]; LIST[J]=T; }                }            }            foreach(varIteminchlist)            {Console.WriteLine (item); }        }        Static voidQuickSort (int[] Arry,intLeftintRight//Quick Sort        {            if(Left <Right ) {                inti = left, j =Right ; intx =Arry[i];  while(I <j) { while(I < J && Arry[j] >=x) {J--; } Arry[i]=Arry[j];  while(I < J && Arry[i] <=x) {i++; } Arry[j]=Arry[i]; } Arry[i]=x; QuickSort (Arry, left, I-1); QuickSort (Arry, J+1, right); }        }        Static voidQuickTest () {int[] Arry =New int[] {9,2,4, About,2, the,1,0, A,2,9 }; QuickSort (Arry,0, Arry. Length-1); foreach(varIinchArry)            {Console.WriteLine (i); }        }        Static voidInsertsort ()//Direct Insert Sort        {            int[] Arry =New int[] {1,3,4,2, About,2, the,1,0, A,2,9 };  for(inti =1; I < Arry. Length; i++)            {                if(Arry[i-1] >Arry[i]) {                    intJ; inttemp =Arry[i];  for(j = i-1; J >=0&& Arry[j] > temp; j--) {arry[j+1] =Arry[j]; } arry[j+1] =temp; }            }            foreach(varIinchArry)            {Console.WriteLine (i); }        }        Static voidBinaryinsertsort ()//Two-point insertion sort        {            int[] Arry =New int[] {1,3,4,2, About,2, the,1,0, A,2,9 };  for(inti =0; I < Arry. Length; i++)            {                vartemp =Arry[i]; intLow =0; intHigh = i-1; intMID =0;  while(Low <=High ) {Mid= (low + high)/2; if(Temp <Arry[mid]) { High= Mid-1; }                    Else{ Low= Mid +1; }                }                intj =0;  for(j = i-1; J >= High +1; j--) {arry[j+1] =Arry[j]; } arry[j+1] =temp; }            foreach(varIinchArry)            {Console.WriteLine (i); }        }        #endregion    

Basic sorting algorithm (C #)