三种简单排序算法（冒泡、选择、插入）

using System;
using System.Collections.Generic;
using System.Text;
namespace ConsoleApplication1
{
    class Program
    {
        static void Main(string[] args)
        {
            int[] arr = { 99,98,50,100,43,122,20};

            //bubbleSort(arr);
            selectionSort(arr);
            //insertionSort(arr);
            foreach (int item in arr)
            {
                Console.WriteLine(item);
            }
            Console.ReadKey();
        }

        public static void bubbleSort(int[] intArr)
        {
            int i, j=1, temp;
            while (j < intArr.Length)
            {
                for (i = 0; i < intArr.Length-j; i++)
                {
                    if (intArr[i] > intArr[i + 1])
                    {
                        temp = intArr[i];
                        intArr[i] = intArr[i + 1];
                        intArr[i + 1] = temp;
                    }
                }
                j++;
            }
        }

        public static int min;
        public static void selectionSort(int[] intArr)
        {
            for (int i = 0; i < intArr.Length; ++i)
            {
                min = i;
                for (int j = i+1; j < intArr.Length; ++j)
                {
                    if (intArr[j] < intArr[min])
                    {
                        min = j;
                    }
                    int temp = intArr[min];
                    intArr[min] = intArr[i];
                    intArr[i] = temp;
                }
            }
        }


        public static void insertionSort(int[] intArr)
        {
            for (int i = 1; i < intArr.Length; i++)
            {
                int temp = intArr[i];
                int j = i;
                while (j > 0 && intArr[j - 1] > temp)
                {
                    intArr[j] = intArr[j - 1];
                    --j;
                }
                intArr[j] = temp;
            }
        }

    }
}