guopeng-blogs

Java冒泡排序

Posted on 2018-01-17 20:23 跳跳糖~ 阅读(...) 评论(...) 编辑 收藏

public class Sort {

  public static void main(String[] args) {

    //首先定义一个数组
    int[] arrs = { 7, 2, 1, 6, 5, 3, 9, 0 };

    String s1 = "";
    for (int i : arrs) {
      s1 += i + ",";
    }
    System.out.println("排序前:{" + s1.substring(0, s1.length() - 1) + "}");

    // 最多做n - 1趟排序
    for (int i = 0; i < arrs.length - 1; i++) {
      // 对当前无序的区间进行排序
      // arrs[0,1,...,arrs.length - i - 1]
      for (int j = 0; j < arrs.length - i - 1; j++) {
        if (arrs[j] > arrs[j + 1]) {
          int temp = arrs[j];
          arrs[j] = arrs[j + 1];
          arrs[j + 1] = temp;
        }
      }
    }
    String s2 = "";
    for (int i : arrs) {
      s2 += i + ",";
    }
    System.out.println("排序后:{" + s2.substring(0, s2.length() - 1) + "}");
  }
}

相关文章:

猜你喜欢
  • 2019-06-13
  • 2021-10-12
  • 2017-12-08
  • 2021-12-15
  • 2019-09-22
相关资源
相似解决方案