C# 排序



protected void Page_Load(object sender, EventArgs e)
        {
            int[] array = { 49, 38, 65, 97, 76, 13, 27, 100, 3 };
            string aa = string.Empty;
            //sort(array, 0, array.Length - 1);
            sortmaopao(array);
            for (int i = 0; i < array.Length; i++)
            {
                aa += array[i].ToString() + ",";
            }
            Response.Write(aa);
        }
        ///

        /// 快速排序方法
        ///

        ///
        ///
        ///
        ///
        public int guize(int[] array,int begin,int end)
        {
            int beginkey=array[begin];
            while(end>begin)
            {
                while (array[end] >= beginkey && end > begin)
                {
                    --end;
                }
                array[begin]=array[end];
                while (array[begin] <= beginkey && end > begin)
                {
                    ++begin;
                }
                array[end] = array[begin];

            }
            array[begin] = beginkey;

            return end;
        }
        ///

        /// 快速排序递归
        ///

        ///
        ///
        ///
        public void sort(int[] array,int begin,int end)
        {
            if (begin > end)
                return;
            int index = guize(array,begin,end);
            sort(array,begin,index-1);
            sort(array, index +1, end);
        }

        ///

        /// 冒泡排序
        ///

        ///
        public void sortmaopao(int[] arrar)
        {
            int temp = 0;
            for (int i = 0; i < arrar.Length-1; i++)
            {
                for (int j = 0; j < arrar.Length - 1-i; j++)
                {
                    if (arrar[j] > arrar[j+1])
                    {
                        temp = arrar[j];
                        arrar[j] = arrar[j+1];
                        arrar[j+1] = temp;
                    }
                }
            }

        }