zoukankan      html  css  js  c++  java
  • 不同方式实现冒泡

    package study;


    import java.io.BufferedReader;
    import java.io.IOException;
    import java.io.InputStreamReader;

    public class temp
    {
     public static void main(String[] args) throws IOException
     { 
    // 下面相当于从键盘获得int [] a = new int[] {9,3,2,8,10,4,22};
    // 第一种方法
      /* System.out.println("请输入五个整数:");
     
      int  a[] = new int [5]; 
      for (int i=0;i<5;i++)
      {
      InputStreamReader ir=new InputStreamReader(System.in);
      BufferedReader ln= new BufferedReader(ir);
      String s=ln.readLine();
      int  x =Integer.parseInt(s);
      a[i]=x;
      }   */
    //第二种方法 
        System.out.println("请输入五个整数:");
     int a[] = new int[5];
     InputStreamReader ir = new InputStreamReader(System.in);
     BufferedReader ln = new BufferedReader(ir);
     String s = ln.readLine();
     //读取字符串,用逗号分隔
     String[] b=new String[5];
     b=s.split(",");
     for(int n=0;n<b.length;n++)
     {
      //给数组a赋值
      a[n]=Integer.valueOf(b[n]).intValue();
      System.out.print("a["+n+"]的值:"+a[n]+"; ");
     }
      System.out.println();
      
         for(int i = 0 ; i < a.length-1; i++){
              for(int j = 0 ; j < a.length-i-1; j++){
    //          降序:   if(a[j]< a[j+1])  升序:if(a[j]>a[j+1])
                  if(a[j]> a[j+1]){
                      int temp = a[j];
                      a[j] = a[j+1];
                      a[j+1] = temp;
                                   }
                                                    }
      
             System.out.println("第"+(i+1)+"轮冒泡:");
             for(int k = 0 ; k < a.length; k++){   
                System.out.print(a[k]+"    ");
                                               }
                System.out.println();
                                              }
     }
    }


     

  • 相关阅读:
    OpenJudge计算概论-寻找山顶
    OpenJudge计算概论-配对碱基链
    OpenJudge计算概论-分配病房
    OpenJudge计算概论-计算鞍点
    OpenJudge计算概论-错误探测
    OpenJudge计算概论-文字排版
    OpenJudge计算概论-二维数组右上左下遍历
    OpenJudge-计算点的距离并排序
    OpenJudge计算概论-找最大数序列
    Openjudge计算概论-奇数单增序列
  • 原文地址:https://www.cnblogs.com/halfacre/p/2819068.html
Copyright © 2011-2022 走看看