排序

using System;
using System.Collections.Generic;
using System.Text;

namespace ConsoleApplication_sorts
{
    class Program
    {
        static void Main(string[] args)
        {
            //int[] array ={ 30, 20, 10, 40, 50, 60 };
            int[] array ={ 0, 30, 20, 10, 40, 50, 60 };//用于insertSort
            sort.insertSort(array);
            for (int i = 0; i < array.Length; i++)
            {
                System.Console.Write(array[i]+" ");
            }
        }
    }

    class sort
    {
        public static void bubbleSort(int[] ar)
        {
            for (int i = 0; i < ar.Length; i++)//每冒泡一次，要进行冒泡的序列短一位
            {
                int change = 0;
                for (int j = 0; j < ar.Length-1-i; j++)
                {
                    if (ar[j] > ar[j + 1])
                    {
                        change = 1;
                        int temp = ar[j];
                        ar[j] = ar[j + 1];
                        ar[j + 1] = temp;
                    }
                }
                if (change == 0)
                    break;
            }
        }

        public static void choiceSort(int[] ar)
        {
            for (int i = 0; i < ar.Length; i++)//每次选取右边无序区中最小值放到无序区最前面
            {
                int low = i;
                for (int j = i; j < ar.Length; j++)
                {
                    if (ar[j] < ar[low])
                        low = j;
                }
                if (low != i)//经过选择
                {
                    int temp = ar[low];
                    ar[low] = ar[i];
                    ar[i] = temp;
                }
            }
        }

        public static void insertSort(int[] ar)//第0位置不是要排序列
        {
            for (int i = 2; i < ar.Length; i++)//每次把右边无序区中最前面的值放到左边有序区中适当位置
   {
                ar[0] = ar[i];
                int j;
                for (j = i-1; ar[j] >ar[0]; j--)
                {
                    ar[j + 1] = ar[j];
                }
                ar[j+1] = ar[0];
   }
        }
    }
}