. NET Study notes----2015-07-09 (Basic review and Exercise 06)

Bubble Sort,

I did it two times.

            //1, 3, 4, 2, 6, 8, 7, 9, 0, 5//10 elements, starting with the first one, and then comparing each element in the array,//if nums[0]>nums[1] then two elements exchange position, and so on until Nums[9]//which is to compare 9 times .//the remaining 1 elements must be the smallest (ascending example)             for(inti =0; I < Nums. Length-1; i++)            {                //When the first number is compared, the number does not have to be compared, so j-1-i                 for(intj =0; J < Nums. Length-1I J + +)                {                    inttemp = nums[0]; nums[0] = nums[1]; nums[1] =temp; }                            }             for(inti =0; I < Nums. Length; i++) {Console.WriteLine (Nums[i]=i); }

. NET Study notes----2015-07-09 (Basic review and Exercise 06)