zoukankan      html  css  js  c++  java
  • 冒泡排序-选择排序

      /// <summary>
            /// 选择排序--递归写法
            /// </summary>
            /// <param name="data">数组</param>
            /// <param name="start">开始下标</param>
            /// <param name="end">结束下标</param>
            public void selectSort(int[] data, int start, int end)
            {
                int temp = 0;
                if (start >= end) return;
                for (int i = start + 1; i <= end; i++)
                {
                    if (data[i] < data[start])
                    {
                        temp = data[i];
                        data[i] = data[start];
                        data[start] = temp;
                    }
                }
                selectSort(data, start + 1, end);
            }
    
            /// <summary>
            /// 冒泡排序
            /// </summary>
            /// <param name="data">数组</param>
            public void bubbleSort(int[] data)
            {
                int temp = 0;
                for (int j = 0; j < data.Length - 1; j++)
                {
                    for (int i = 0; i < data.Length - j - 1; i++)
                    {
                        if (data[i] > data[i + 1])
                        {
                            temp = data[i];
                            data[i] = data[i + 1];
                            data[i + 1] = temp;
                        }
                    }
                }
            }
  • 相关阅读:
    GDUFE ACM-1050
    hdu-2020
    hdu-2055
    hdu-2734
    GDUFE ACM-1145
    GDUFE ACM-1127
    GDUFE ACM-1126
    GDUFE ACM-1125
    GDUFE ACM-1124
    GDUFE ACM-1123
  • 原文地址:https://www.cnblogs.com/Harvard-L/p/4380694.html
Copyright © 2011-2022 走看看