Sorting method: Remove the highest minimum to find the average function of the division

Method 1

Namespacefunction Array Sorting takes out the maximum minimum and average value {classProgram {Static voidMain (string[] args) {            int[] b=New int[]{9,1,5,3,7}; intMax =0;//set two variables to receive minimum and minimum values.             intMin =0; intAve =0;//Set Variable to receive the average.             int[]a=NewProgram (). Array (b, outMax outMin outAve);  for(inti =0; i < b.length; i++) {Console.WriteLine (b[i]); } Console.WriteLine ("Maximum Value"+max); Console.WriteLine ("Minimum Value"+min); Console.WriteLine ("Average"+Ave);        Console.ReadLine (); }         Public int[] Array (int[]a, out intX out intY out intAve//jump out of the X, Y and Ave three variables and return the INT[]A variable.         {                      inttemp =0;  for(inti =1; I <= a.length; i++)            {                 for(intj =1; J <= A.length-i; J + +)                {                    if(a[j-1]<A[j]) {Temp= A[j-1]; A[j-1] =A[j]; A[J]=temp; } }} X= a[0];//Maximum Valuey=a[a.length-1];//Minimum Value            intsum =0;  for(inti =0; i < a.length; i++) {sum= Sum +A[i]; } Ave= SUM/(a.length); returnA; }    }}

Method 2

namespaceconsoleapplication10{classProgram { Public Double[] Paixu (Double[] a) {Doubletemp;  for(inti =0; i < a.length; i++)//number of bit loops quick sort            {                 for(intj = i; J < A.length-1; J + +)//number of digits compared to the following                {                    if(A[i] < A[j +1]) {temp=A[i]; A[i]= A[j +1]; A[j+1] =temp; }                }            }            returnA; }        Static voidMain (string[] args) {Console.backgroundcolor=Consolecolor.white;            Console.clear (); Double[] A =New Double[5]; Doublesum =0;  for(inti =0; i < a.length; i++) {A[i]=Convert.ToInt32 (Console.ReadLine ()); Sum= Sum +A[i]; Console.foregroundcolor=consolecolor.red; Console.WriteLine ("Section"+ (i +1) +"A judge's score is"+A[i]); } Console.foregroundcolor=consolecolor.red; Console.WriteLine ("Total score is"+sum); Double[] B =NewProgram (). Paixu (a);  for(inti =0; I <a.Length; i++) {Console.WriteLine (a[i]); } Console.foregroundcolor=consolecolor.red; Console.WriteLine ("Highest score"+ a[0]); Console.WriteLine ("Minimum score"+ a[4]); DoublePJ = (sum-a[0]-a[4])/(a.length-2); Console.WriteLine ("The average final score after removing a maximum score and a minimum score is"+PJ);        Console.ReadLine (); }    }}

Sorting method: Remove the highest minimum to find the average function of the division