算法(0)_冒泡排序

案例1——冒泡排序（使用于int类型）
bool swapped = true;
do{
	swapped = false;
	for(int i =0;i<sortArray.Length -1;i++){
		if(sortArray[i]>sortArray[i+1]){
			int temp= sortArray[i];
			sortArray[i]=sortArray[i+1];
			sortArray[i+1]=temp;
			swapped = true;
		}
	}
}while(swapped);

案例2——
class Employee{
	public Employ(string name,decimal salary){
		this.Name = name;
		this.Salary = salary;
	}
	public string Name{get;private set;}
	public decimal Salary{get;private set;}
	public static bool CompareSalary(Employee e1,Employee e2){
		return e1.salary>e2.salary;
	}
}

//通用排序方法
public static void Sort<T>( List<T> sortArray,Func<T,T,bool> comparision ){
	bool swapped = true;
	do{
		swapped = false;
		for(int i=0;i<sortArray.Count-1;i++){
			if(sortArray[i+1].salart > sortArray[i].salary){
				T temp = sortArray[i];
				sortArray[i]=sortArray[i+1];
				sortArray[i+1]=temp;
				swapped = true;
			}
		}
	}while(swapped);
}


//对雇员类排序
static void Main(){
	Employee[] employees = {
		new Employee("Bunny",20000),		
		new Employee("Bunny",10000),		
		new Employee("Bunny",25000),		
		new Employee("Bunny",100000),		
		new Employee("Bunny",23000),		
		new Employee("Bunny",50000),
		};
	Sort(employees,Employee.CompareSalary);
	输出
}