zoukankan      html  css  js  c++  java
  • 冒泡排序算法

    新建控制台应用程序:

    输入如下代码:

     class King
        {
            public void BubbleSort()
            {
                int[] array = new int[10];
                for (int h = 0; h < 10; h++)
                {
                    Console.WriteLine("请输入第{0}一个数:", h + 1);
                    array[h] = int.Parse(Console.ReadLine());
                }

                int temp;
                for (int i = 0; i < array.Length; i++)
                {
                    for (int j = i + 1; j < array.Length; j++)
                    {
                        temp = array[i];
                        if (array[i] > array[j])
                        {
                            array[i] = array[j];
                            array[j] = temp;
                        }
                    }
                }
                for (int k = 0; k < array.Length; k++)
                {
                    Console.Write("{0,6}", array[k]);
                }
            }
        }

    调用:

     static void Main(string[] args)
            {
                King king = new King();
                king.BubbleSort();
                Console.Read();
            }

  • 相关阅读:
    D. Constructing the Array
    B. Navigation System
    B. Dreamoon Likes Sequences
    A. Linova and Kingdom
    G. Special Permutation
    B. Xenia and Colorful Gems
    Firetrucks Are Red
    java getInstance()的使用
    java 静态代理和动态代理
    java 类加载机制和反射机制
  • 原文地址:https://www.cnblogs.com/zwq194/p/2143114.html
Copyright © 2011-2022 走看看