c#冒泡排序实例

 static void Main(string[] args)
        {
            int[] array = { 1, 3, 5, 7, 90, 2, 4, 6, 8, 10 };
            array = GetSort(array);
            for (int i = 0; i < array.Length; i++)
            {
                Console.Write(array[i] + " ");
            }
            Console.ReadKey();
        }
        private static int[] GetSort(int[] array)
        {
            //外层循环n-1
            for (int i = 0; i < array.Length - 1; i++)
            {
                //内层循环n-1-i
                for (int j = 0; j < array.Length - 1 - i; j++)
                {
                    if (array[j] > array[j + 1])
                    {
                        int temp = array[j];
                        array[j] = array[j + 1];
                        array[j + 1] = temp;
                    }
                }
            }
            return array.ToArray();
        }