探讨如何用委托处理排序

namespaceConsoleApplication1
{
   publicdelegateboolDelegateTest(objectobj1,objectobj2);
   classClass1
   {
       staticvoidMain()
       {
           Employee[]Employees=
             {
                 newEmployee("huguo",1000000),
                 newEmployee("lili",20000),
                 newEmployee("lulu",30000),
                 newEmployee("xixi",50000),
                 newEmployee("jianjian",10000),
                 newEmployee("yoyo",9000)
             };
           //委托DelegateTest代理的方法是Greate
           DelegateTestMyTest=newDelegateTest(Employee.Greate);
           SorterMySort=newSorter();
           //冒泡算法中第一个参数是对应Employees数组信息,第二个参数是委托
           MySort.Sort(Employees,MyTest);
           for(intm=0;m<Employees.Length;m++)
           {
               Console.WriteLine(Employees[m].ToString());
           }
       }
   }
   classEmployee
   {
       publicstringName;
       publicintSalary;
       publicEmployee(stringName,intSalary)
       {
           this.Name=Name;
           this.Salary=Salary;
       }
       //用override重写string方法
       publicoverridestringToString()
       {
           returnstring.Format(Name+",{0:C},",Salary);
       }
       //定义一个方法,如果obj2传过来的Salary大于obj1就返回true;
       publicstaticboolGreate(objectobj1,objectobj2)
       {
           EmployeeEmployee1=(Employee)obj1;
           EmployeeEmployee2=(Employee)obj2;
           return(Employee2.Salary>Employee1.Salary)?true:false;
       }
   }
   classSorter
   {
       publicvoidSort(object[]ArrayObj,DelegateTestTest)
       {
           //下面就是冒泡算法啦
           for(inti=0;i<ArrayObj.Length;i++)
           {
               for(intj=i+1;j<ArrayObj.Length;j++)
               {
                   if(Test(ArrayObj[j],ArrayObj[i]))
                   {
                       objectTemp=ArrayObj[i];
                       ArrayObj[i]=ArrayObj[j];
                       ArrayObj[j]=Temp;
                   }
               }
           }
       }
   }

}