冒泡排序法

来源：互联网发布：c++界面编程编辑：程序博客网时间：2024/06/05 16:06
using System;using System.Collections.Generic;using System.Linq;using System.Text;using System.Threading.Tasks;namespace ConsoleApplication1{    class Program    {        static void Main(string[] args)        {            int[] arr = new int[] {87,85,89,84,76,82,90,79,78,68};            Console.Write("原始序列为： ");            foreach(int num in arr)            {                Console.Write("{0}"+" ",num);            }            Console.WriteLine();            int j, temp;            //排序            for (int i = 0; i < arr.Length - 1; i ++ )            {                //j = i + 1;                for (j = i + 1; j < arr.Length - 1; j ++ )                {                    if (arr[i] > arr[j])                    {                        temp = arr[i];                        arr[i] = arr[j];                        arr[j] = temp;                    }                                    }            }            //打印            Console.Write("冒泡排序后的序列为：");            foreach(int num in arr)            {                Console.Write(num + " ");            }                       Console.Read();        }    }}
0 0