冒泡算法从大到小的排序或从小到大排序一秒即懂

最新推荐文章于 2025-04-17 11:37:32 发布

可达鸭-可达鸭

最新推荐文章于 2025-04-17 11:37:32 发布

阅读量167

点赞数

文章标签：算法 java

本文链接：https://blog.csdn.net/m0_58396096/article/details/120769713

版权

//冒泡算法从大到小
public class Test {
    public static void main(String[] args) {

        int array[] ={-5,-2,5,10,895};
        for (int i = 0; i < array.length + 1; i++) {
            for (int j = i+1; j < array.length; j++) {
            if (array[i] <array[j]){
                int temp = array[i];
                array[i] = array[j];
                array[j]=temp;
            }
            }
        }
        for (int i = 0; i < array.length; i++) {
            System.out.println(" "+array[i]+"");
        }
    }
}
* 冒泡算法从小到大
 */
public class TestDo {
    public static void main(String[] args) {

        int array[] = {-5, -2, 5, 10, 895};
        for (int i = 0; i < array.length - 1; i++) {
            if (array[i] > array[i + 1]) {
                int temp = array[i];
                array[i] = array[i + 1];
                array[i + 1] = temp;

            }
        }
        for (int i = 0; i < array.length; i++) {
            System.out.println(" " + array[i] + "");
        }
    }
}