using System;

namespace QuickSorter
{
    public class QuickSorter
    {
          private void Swap(ref int l,ref int r)
          {
           int s;
           s=l;
           l=r;
           r=s;
          }
          public void Sort(int [] list,int low,int high)
          {
           int pivot;
           int l,r;
           int mid;
           if(high<=low)
            return;
           else if(high==low+1)
           {
            if(list[low]>list[high])
             Swap(ref list[low],ref list[high]);
            return;
           }
           mid=(low+high)>>1;
           pivot=list[mid];
           Swap(ref list[low],ref list[mid]);
           l=low+1;
           r=high;
           do
           {
               while(l<=r&&list[l]<pivot)
                l++;
               while(list[r]>=pivot)
                r--;
                if(l<r)
                 Swap(ref list[l],ref list[r]);
               }while(l<r);
               list[low]=list[r];
               list[r]=pivot;
               if(low+1<r)
                Sort(list,low,r-1);
               if(r+1<high)
                Sort(list,r+1,high);
          }
         }
     public class MainClass
     { 
      public static void Main()
      {
       int[] iArrary=new int[]{1,5,3,6,10,55,9,2,87,12,34,75,33,47};
       QuickSorter q=new QuickSorter();
       q.Sort(iArrary,0,13);
       for(int m=0;m<=13;m++)
        Console.WriteLine("{0}",iArrary[m]);  
      }
  }

}

using System;
using System.Collections.Generic;
using System.Text;

namespace QuickSort
{
    class Program
    {
        static void Main(string[] args)
        {
            int[] nums = new int[] { 21, 32, 445,54,325,62,19, 65, 37, 67, 1, 2, 4, 7, 84 };
            Quick_Sort q = new Quick_Sort(nums);
            q.QKSort(0, nums.Length - 1);
            for (int i = 0; i < nums.Length; i++)
            {
                Console.WriteLine(nums[i]);
            }
            Console.Read();


        }
    }
}
public class Quick_Sort
{
    public int [] nums;
    public Quick_Sort(int[] nums)
    {
        this.nums=nums;

    }
   public void QKSort(int Begin,int End )
    {
       int mid;
       //如果数组只剩1个数
        if (Begin == End)
            return;
       //如果只剩下2个
        if (Begin + 1== End)
        {
            if (nums[Begin] > nums[End])
            {
                mid = nums[Begin];
                nums[Begin] = nums[End];
                nums[End] = mid;
            }
            return;
        }
       //标志位，当为True时，左边指针移动，FLASE时，右边
        bool Flag = false;
       //附加空间
        int added;
       //b指向数组的头，e指向尾
       int b=Begin;
       int e=End;
       //提取出数组第一个数作为参照数
       added = nums[b];
       while (b < e)
       {
           if (Flag)//判断左边的数
           {
               if (nums[b] > added)
               {
                   //交换到右边去
                   nums[e] = nums[b];
                   Flag = false;
               }
               else
                   b++;
           }
           else//判断右边的数
           {
               if (nums[e] < added)
               {
                   //交换到左边去
                   nums[b] = nums[e];
                   Flag = true;
               }
               else
                   e--;
              
           }
       }
       //这时b=e
       nums[b] = added;
       //递归
       if (b > Begin)
           QKSort( Begin, b - 1);
       if (b < End)
           QKSort( b + 1, End);

    }
}

void fun( int input) 
{ 
    if (input >= 14) 
        fun(input/14); 
    printf("%c","0123456789ABCD"[input%14]); 
}