C#.NET实现经典排序算法

1、选择排序
希尔排序

public class ShellSorter

{

public void Sort(int[] arr)

{

int inc;

for (inc = 1; inc <= arr.Length / 9; inc = 3 * inc + 1) ;

for (; inc > 0; inc /= 3)

{

for (int i = inc + 1; i <= arr.Length; i += inc)

{

int t = arr[i - 1];

int j = i;

while ((j > inc) && (arr[j - inc - 1] > t))

{

arr[j - 1] = arr[j - inc - 1];//交换数据

j -= inc;

}

arr[j - 1] = t;

}

}

}

static void Main(string[] args)

{

int[] array = new int[] { 1, 5, 3, 6, 10, 55, 9, 2, 87, 12, 34, 75, 33, 47 };

ShellSorter s = new ShellSorter();

s.Sort(array);

foreach (int m in array)

Console.WriteLine("{0}", m);

}

}