数组冒泡算法

public class ArrayDemo06
{
    public static void main(String[] args)
    {
        int score[]={67,89,87,69,90,100,75,90};
        for (int i=1;i<score.length ;i++ )
        {
            for (int j=0;j<score.length ;j++ )//内层循环是和每一个数比较
            {
                if (score[i]<score[j])
                {
                    int temp=score[i];
                    score[i]=score[j];
                    score[j]=temp;
                }
            }
        }
        for (int i=0;i<score.length ;i++ )
        {
            System.out.println("从小到大输出:"+score[i]);
        }
    }
}

详细是输出每一次比较的结果

public class ArrayDemo07
{
    public static void main(String[] args)
    {
        int score[]={67,89,87,69,90,100,75,90};
        for (int i=1;i<score.length ;i++ )
        {
            for (int j=0;j<score.length ;j++ )
            {
                if (score[i]<score[j])//比较后交换两个数
                {
                    int temp=score[i];
                    score[i]=score[j];
                    score[j]=temp;
                }
            }
            System.out.print("第"+i+"次的排序的结果:  ");
            for (int j=0;j<score.length ;j++ )
            {
                System.out.print(score[j]+"	");
            }
            System.out.println("");
        }

        System.out.print("最终的排序结果为 :  ");
        for (int i=0;i<score.length ;i++ )
        {
            System.out.print(score[i]+"	");
        }
    }
}