java冒泡排序，正序反序

最新推荐文章于 2022-06-24 08:02:30 发布

如序

最新推荐文章于 2022-06-24 08:02:30 发布

阅读量2.2k

点赞数 1

分类专栏：算法结构

本文链接：https://blog.csdn.net/u011937566/article/details/81136687

版权

算法结构专栏收录该内容

3 篇文章 0 订阅

订阅专栏

/**
* 冒泡排序，正序反序
*
* @author dell
*
*/
public class JinZhiZhuanHuan {
   public static void main(String[] args) {
       int[] ints = { 1, 4, 2, 4, 2, 3, 4543, 11, 3, 6 };
       bubbleAscSort(ints);
       System.out.println("");
       bubbleDescsort(ints);
   }
   /**
   * 正序
   * @param ints
   */
   private static void bubbleAscSort(int[] ints) {
       for (int i = 0; i < ints.length; i++) {
           for (int j = 0; j < ints.length - 1; j++) {
               if (ints[j] > ints[j + 1]) {
                   int temp = ints[j];
                   ints[j] = ints[j + 1];
                   ints[j + 1] = temp;
               }
           }
       }
       for (int it : ints) {
           System.out.print(it+" ");
       }
   }
   /**
   * 倒序
   * @param ints
   */
   private static void bubbleDescsort(int[] ints) {
       for (int i = 0; i < ints.length; i++) {
           for (int j = 0; j < ints.length - 1; j++) {
               if (ints[j] <ints[j + 1]) {
                   int temp = ints[j];
                   ints[j] = ints[j + 1];
                   ints[j + 1] = temp;
               }
           }
       }
       for (int it : ints) {
           System.out.print(it+" ");
       }
   }