冒泡排序-Java板块造梦空间论坛-技术交流-造梦空间论坛

冒泡排序

冒泡排序例子:

  • 比如说现在有abcd三个值
  • 然后a和b比较,如果a大于b则继续去和c比较如果又大于c那就继续去和d比较
  • 然后第二轮接着b和c去比较,如果b又大于c就继续和d比较
  • 然后就是c和d比较
  • 如图效果3d0839f60d011149

     

写法例子:

int arr[]=new int[10];
int a=0;
Scanner input=new Scanner(System.in);
for (int i = 0; i < arr.length; i++) {
System.out.print("请输入第"+(i+1)+"个元素:");
a=input.nextInt();
arr[i]=(int) a;
}
System.out.println("初始数据=");
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i]);
}
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < arr.length; j++) {
if (arr[i]<arr[j]) {
int arr1[]= {0};
arr1[0]=arr[i];
arr[i]=arr[j];
arr[j]=arr1[0];
}
}
}
System.out.println("\n处理后数据=");
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i]);
}
int arr[]=new int[10];
    int a=0;
    Scanner input=new Scanner(System.in);
    for (int i = 0; i < arr.length; i++) {
      System.out.print("请输入第"+(i+1)+"个元素:");
      a=input.nextInt();
      arr[i]=(int) a;
    }
    System.out.println("初始数据=");
    for (int i = 0; i < arr.length; i++) {
      System.out.print(arr[i]);
    }
    for (int i = 0; i < arr.length; i++) {
      
      for (int j = 0; j < arr.length; j++) {
        if (arr[i]<arr[j]) {
          int arr1[]= {0};
          arr1[0]=arr[i];
          arr[i]=arr[j];
          arr[j]=arr1[0];
        }
      }
    }
    System.out.println("\n处理后数据=");
    for (int i = 0; i < arr.length; i++) {
      System.out.print(arr[i]);
    }
int arr[]=new int[10]; int a=0; Scanner input=new Scanner(System.in); for (int i = 0; i < arr.length; i++) { System.out.print("请输入第"+(i+1)+"个元素:"); a=input.nextInt(); arr[i]=(int) a; } System.out.println("初始数据="); for (int i = 0; i < arr.length; i++) { System.out.print(arr[i]); } for (int i = 0; i < arr.length; i++) { for (int j = 0; j < arr.length; j++) { if (arr[i]<arr[j]) { int arr1[]= {0}; arr1[0]=arr[i]; arr[i]=arr[j]; arr[j]=arr1[0]; } } } System.out.println("\n处理后数据="); for (int i = 0; i < arr.length; i++) { System.out.print(arr[i]); }

重点是这一块

for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < arr.length; j++) {
if (arr[i]<arr[j]) {
int arr1[]= {0};
arr1[0]=arr[i];
arr[i]=arr[j];
arr[j]=arr1[0];
}
}
}
for (int i = 0; i < arr.length; i++) {
      
      for (int j = 0; j < arr.length; j++) {
        if (arr[i]<arr[j]) {
          int arr1[]= {0};
          arr1[0]=arr[i];
          arr[i]=arr[j];
          arr[j]=arr1[0];
        }
      }
    }
for (int i = 0; i < arr.length; i++) { for (int j = 0; j < arr.length; j++) { if (arr[i]<arr[j]) { int arr1[]= {0}; arr1[0]=arr[i]; arr[i]=arr[j]; arr[j]=arr1[0]; } } }

 

请登录后发表评论

    没有回复内容

© 造梦空间论坛
❤富强❤