/// <summary>
 /// 策略類，定義了所有支持的算法的公共接口
 /// </summary>
 public abstract class Stratege
 {
  /// <summary>
  /// 策略類中支持的算法，當(dāng)然還可以有更多，這里只定義了一個。
  /// </summary>
  public abstract void Algorithm();
 }

 /// <summary>
 /// 具體策略 A，實現(xiàn)了一種具體算法
 /// </summary>
 public class ConcreteStrategeA : Stratege
 {

  /// <summary>
  /// 具體算法
  /// </summary>
  public override void Algorithm()
  {
   // 策略A中實現(xiàn)的算法
  }
 }
 /// <summary>
 /// 具體策略 B，實現(xiàn)了一種具體算法
 /// </summary>
 public class ConcreteStrategeB : Stratege
 {

  /// <summary>
  /// 具體算法
  /// </summary>
  public override void Algorithm()
  {
   // 策略B中實現(xiàn)的算法
  }
 }


 /// <summary>
 /// Context 上下文，維護(hù)一個對Stratege對象的引用
 /// </summary>
 public class Context
 {
  private Stratege m_Stratege;

  /// <summary>
  /// 初始化上下文時，將具體策略傳入
  /// </summary>
  /// <param name="stratege"></param>
  public Context(Stratege stratege)
  {
   m_Stratege = stratege;
  }

  /// <summary>
  /// 根據(jù)具體策略對象，調(diào)用其算法
  /// </summary>
  public void ExecuteAlgorithm()
  {
   m_Stratege.Algorithm();
  }
 }

 /// <summary>
 /// 排序算法策略
 /// </summary>
 public abstract class SortStratege
 {
  /// <summary>
  /// 排序
  /// </summary>
  /// <param name="array"></param>
  /// <returns></returns>
  public abstract int[] Sort(int[] array);
 }

 /// <summary>
 /// 冒泡排序
 /// </summary>
 public class BubbleSort : SortStratege
 {
  /// <summary>
  /// 冒泡排序算法(遞增排序)
  /// </summary>
  /// <param name="array"></param>
  /// <returns></returns>
  public override int[] Sort(int[] array)
  {
   // 實現(xiàn)冒泡排序算法
   for (int i = 0; i < array.Length; i++)
   {
    for (int j = i + 1; j < array.Length; j++)
    {
     if (array[i] > array[j])
     {
      int temp = array[j];
      array[j] = array[i];
      array[i] = temp;
     }
    }
   }

   return array;
  }
 }

 /// <summary>
 /// 插入排序
 /// </summary>
 public class InsertSort : SortStratege
 {

  /// <summary>
  /// 插入排序算法(遞增排序)
  /// </summary>
  /// <param name="array"></param>
  /// <returns></returns>
  public override int[] Sort(int[] array)
  {
   // 實現(xiàn)插入排序算法
   int temp;
   int i, j, n;
   n = array.Length;

   for (i = 1; i < n; i++)
   {
    temp = array[i];
    for (j = i; j > 0; j--)
    {
     if (temp < array[j - 1])
      array[j] = array[j - 1];
     else
      break;

     array[j] = temp;
    }
   }
   return null;
  }
 }

 public class SortContext
 {
  private int[] m_Array;
  private SortStratege m_Stratege;

  /// <summary>
  /// 初始化時將要排序的數(shù)組和排序策略傳入給Context
  /// </summary>
  /// <param name="array"></param>
  /// <param name="stratege"></param>
  public SortContext(int[] array, SortStratege stratege)
  {
   m_Array = array;
   m_Stratege = stratege;
  }

  /// <summary>
  /// 調(diào)用排序算法
  /// </summary>
  /// <returns></returns>
  public int[] Sort()
  {
   int[] result = m_Stratege.Sort(this.m_Array);

   return result;
  }
 }

 public class Program
 {
  public static void Main(Object[] args)
  {
   int[] array = new int[] { 12, 8, 9, 18, 22 };

   //使用冒泡排序算法進(jìn)行排序
   SortStratege sortStratege = new BubbleSort();
   SortContext sorter = new SortContext(array, sortStratege);
   int[] result = sorter.Sort();

   //使用插入排序算法進(jìn)行排序
   SortStratege sortStratege2 = new InsertSort();
   SortContext sorter2 = new SortContext(array, sortStratege2);
   int[] result2 = sorter.Sort();
  }
 }