package com.lqz.order;
/**
* 冒泡排序
* @author admin
*
*/
public class Bubble {
//对数组a进行排序
public static void sort(int[] a) {
for(int i=0;i<a.length-1;i++) {//外层循环控制循环趟数的多少
for(int j=0;j<a.length-i-1;j++) {//内层循环控制每一趟所进行的排列次数
if(greater(a[j], a[j+1])) {
exch(a, j, j+1);
}
}
}
}
//判断v是否大于w
private static boolean greater(int v,int w) {
return v-w>0;
}
//交换数组arr中索引i和j处的值
private static void exch(int[] arr,int i,int j) {
int temp;
temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
测试类:
package com.lqz.order;
import java.util.Arrays;
public class Test {
public static void main(String[] args) {
String str;
int[] a = {4,5,6,3,2,1};
System.out.println("转换前的数组"+Arrays.toString(a));
Bubble.sort(a);
System.out.println("转换后的数组"+Arrays.toString(a));
}
}