冒泡算法

冒泡排序：

可以直接编译

Code
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace maopaoA
{
    class Program
    {
        static void Main(string[] args)
        {
            
            int[] myarr = new int[]{1,2,19,15,48,54,24,14,63,91};
            
            maopao(myarr);
            
            Console.ReadLine();
        }
        //冒泡排序方法
        static void maopao(int[] MyArr)
        {
            int i,j;
            int temp=0;
            
            //冒泡排序
            for(j=MyArr.Length-1;j>0;j--)
            {
                for(i=0;i<j;i++)
                {
                    if(MyArr[i]>MyArr[i+1])
                    {
                        temp=MyArr[i];
                        MyArr[i]=MyArr[i+1];
                        MyArr[i+1]=temp;
                    }
                }
            }

            //输出数组
            for(i=0;i<MyArr.Length;i++)
            {
                Console.WriteLine("第{0}位数是{1}",i,MyArr[i]);
            }
            
        }
    }
}

转载于:https://www.cnblogs.com/danwei/archive/2009/04/18/1438907.html