通用冒泡法排序算法

//------------------------------------------------------------------------------
// <auto-generated>
//     此代码由工具生成。
//     运行时版本:4.0.30319.33440
//
//     对此文件的更改可能会导致不正确的行为,并且如果
//     重新生成代码,这些更改将会丢失。
// </auto-generated>
//------------------------------------------------------------------------------
using System;
namespace Solution7
{
	public class Program
	{
		static void CommonSort<T> (T[] sortArray, Func<T,T,bool> compareMethod)
		{
			bool swapped = true;
			do {
				swapped = false;
				for (int i = 0; i < sortArray.Length -1; i++) {
					if (compareMethod (sortArray [i], sortArray [i + 1])) {
						T temp = sortArray [i];
						sortArray [i] = sortArray [i + 1];
						sortArray [i + 1] = temp;
						swapped = true;
					}
				}
			} while(swapped);
		}


		static void Main ()
		{
			Employee[] employees = new Employee[]{
				new Employee ("sldjf", 3947),
				new Employee ("sdf", 334),
				new Employee ("fgd", 343),
				new Employee ("3242df", 43),
				new Employee ("34dfsf", 3447),

			};
			CommonSort (employees, Employee.Compare);
			foreach (var item in employees) {
				Console.WriteLine (item);

			}

		}
	}
}
//------------------------------------------------------------------------------
// <auto-generated>
//     此代码由工具生成。
//     运行时版本:4.0.30319.33440
//
//     对此文件的更改可能会导致不正确的行为,并且如果
//     重新生成代码,这些更改将会丢失。
// </auto-generated>
//------------------------------------------------------------------------------
using System;
namespace Solution7
{
	public class Employee
	{
		public int Salery{ get; private set; }
		public string Name;


		public Employee (string name, int salery)
		{
			Name = name;
			Salery = salery;
		}
		public static bool Compare (Employee e1, Employee e2)
		{
			if (e1.Salery > e2.Salery)
				return true;
			return false;
		}
		public override string ToString ()
		{
			return string.Format ("[Employee: Name={0}, Salery={1}]", Name, Salery);
		}
		
	}
}

猜你喜欢

转载自hypercube.iteye.com/blog/2251879