【简单算法】快速排序、斐波拉切缓存

1. 快速排序：

        private static void FastSort(int[] data, int low, int high)
        {
            int i = low;
            int j = high;
            int mid = data[(low + high) / 2];
            do
            {
                while (data[i] < mid && i < high)
                {
                    i++;
                }
                while (data[j] > mid && j > low)
                {
                    j--;
                }
                if (i <= j)
                {
                    int temp = data[i];
                    data[i] = data[j];
                    data[j] = temp;
                    i++;
                    j--;
                }
            } while (i <= j);
            if (i < high)
            {
                FastSort(data, i, high);
            }
            if (j > low)
            {
                FastSort(data, low, j);
            }
        } 

2. 斐波拉切缓存：

    class Phabe
    {
        private static List<long> phabeList;
        static Phabe()
        {
            phabeList = new List<long>();
            phabeList.Add(1);
            phabeList.Add(1);
        }
        private static void CalcTo(int to)
        {
            while (phabeList.Count < to)
            {
                int count = phabeList.Count;
                long temp = phabeList[count - 1] + phabeList[count - 2];
                phabeList.Add(temp);//缓存计算结果
            }
        }
        public static long Get(int index)
        {
            if (index <= 0)
            {
                return 0;
            }
            if (phabeList.Count < index)
            {
                CalcTo(index);
            }
            //Console.WriteLine("Total: " + phabeList.Count);
            return phabeList[index-1];
        }
    }