冒泡排序

标签：new   for   i++   bsp   []   冒泡   array   冒泡排序   nbsp   

int [] array = new int[]{69,3,52,87,32,14,66,1,89};

            int temp = 0 ;

            for (int i = 0 ; i < array.Length - 1 ; i++)

            {

                for (int j = i + 1 ; j < array.Length ; j++)

                {

                    if (array[j] < array[i])

                    {

                        temp = array[i] ;

                        array[i] = array[j] ;

                        array[j] = temp ;

                    }

                }

            }

冒泡排序

标签：new   for   i++   bsp   []   冒泡   array   冒泡排序   nbsp   

原文地址：https://www.cnblogs.com/myBlogOu/p/9940096.html