java：冒泡法

package xingqushi;

import java.util.Scanner;

public class ComplexLoop 
{

    public static void main(String[] args) 
    {
        int[] numbers={78,23,19,36,42,18,9,54,31,79,47};
//      int[] numbers={5,6,4,5,2,1,8,9};
        //首先从第一个数组到最后，外层循环控制趟数
        for(int i=0;i<numbers.length-1;i++)
        {
            //内层循环控制比较的次数
            for(int j=0;j<numbers.length-i-1;j++)
            {
                if(numbers[j]>numbers[j+1])
                {
                    int a =numbers[j];
                    numbers[j]=numbers[j+1];
                    numbers[j+1]=a;
                }else
                {
                    continue;
                }
            }
        }
        for(int i=0;i<numbers.length;i++)
        {
            System.out.print(numbers[i]+"\t");
        }
    }
}