zoukankan      html  css  js  c++  java
  • 几种基本的排序算法

           protected int[] bubbleUp(int[] Array)//冒泡排序
            {
                for (int i = 0; i < Array.Length-1; i++)//要冒泡次数
                {
                    for (int j = 0; j < Array.Length-1-i; j++)//每次冒泡具体比较过程
                    {
                        if (Array[j] < Array[j + 1])
                        {
                            int temp = Array[j + 1];
                            Array[j + 1] = Array[j];
                            Array[j] = temp;
                        }
                    }
                }
                return Array;
            }
            public int[] SelectionSorter(int[] list)//选择排序
            {
                int min;
                for (int i = 0; i < list.Length - 1; i++)
                {
                    min = i;
                    for (int j = i + 1; j < list.Length; j++ )              
                    {
                        if (list[j] < list[min])
                            min = j;
                    }
                    int temp = list[min];
                    list[min] = list;
                    list = temp;
                }
                return list;
            }
            public int[] InsertionSorter(int[] list)// 插入排序
            {
                for (int i = 1; i < list.Length; i++)
                {
                    int temp = list;
                    int j = i;
                    while ((j > 0) && (list[j - 1] > temp))
                    {
                        list[j] = list[j - 1];
                        --j;
                    }
                    list[j] = temp;
                }
                return list;
            }
            public int[] ShellSorter(int[] list)//希尔排序
            {
                int inc;
                for (inc = 1; inc <= list.Length / 9; inc = 3 * inc + 1) ;
                for (; inc > 0; inc /= 3)
                {
                    for (int i = inc + 1; i <= list.Length; i += inc)
                    {
                        int t = list[i - 1];
                        int j = i;
                        while ((j > inc) && (list[j - inc - 1] > t))
                        {
                            list[j - 1] = list[j - inc - 1];
                            j -= inc;
                        }
                        list[j - 1] = t;
                    }
                }
                return list;
            }

    感谢来访,共同学习!
  • 相关阅读:
    Python正则表达式如何正确运用?七大案例详解
    Python爬虫的谷歌Chrome F12如何抓包分析?案例详解
    Python的Cookie如何正确操作运用呢?案例详解
    八大Python爬虫技巧,你会几个?
    Python爬虫解析神器-正则表达式如何正确运用?案例详解
    Python爬虫之Selector的基本用法正确运用方法,案例详解
    Python爬虫是如何遍历文档树呢?一招教你
    Python之Selenium如何正确运用?案例详解
    Python中的单例模式如何正确运用?本文详解
    JAVA-Spring 整合 JDBC
  • 原文地址:https://www.cnblogs.com/dingxiaowei/p/3058810.html
Copyright © 2011-2022 走看看