精簡代碼-快速排序

來源:互聯網
上載者:User
 

protected void Button2_Click(object sender, EventArgs e)
   

{
       

        string res_arr = string.Empty;

        QuickSort(arr_list, 0, arr_list.Length-1);

        foreach(int i in arr_list)

        {

            res_arr += i + ",";

        }

        Response.Write(res_arr + "<br/>");

        Response.Write(count);

}

 

private void QuickSort(int[] n,int left,int right)

{

        int i = left,j = right,tem;

        tem = n[left];

        while(i < j)

        {

            while (n[j] > tem && i < j)

            {

                --j;

                ++count;

            }

            n[i] = n[j];

            while (n[i] <= tem && i < j)

            {

                ++i;

                ++count;

            }

            n[j] = n[i];

            ++count;

        }

        n[i] = tem;

        if (i - 1 > left) QuickSort(n,left,i-1);

        if (right > i + 1) QuickSort(n,i+1,right);

}

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.