Java冒泡排序算法实现
import java.util.Arrays;
/**
* @description: 冒泡算法实例
* @author: K先生
* @date: 2021-05-23 20:59
*/
public class BubblingSort {
public static void main(String[] args) {
System.out.println(Arrays.toString(arraySort()));
}
/**
*@Auther:K先生
*@MethodName:arraySort
*@Params:[] No such property: code for class: Script1
*@Return:int[] 返回排序后的数组
*@Description:冒泡排序算法
*@Date:21:18 2021/5/23 0023
*/
public static int[] arraySort(){
//按从小到大的顺序进行排序
int[] ints=new int[]{2,5,6,1,9,3,4,8,7};
//定义变量用于交换数据
int agent;
//遍历
for (int s = 0; s < ints.length - 1; s++) {
for (int i = 0; i < ints.length-1; i++) {
if(ints[i]>ints[i+1]){
agent=ints[i];
ints[i]=ints[i+1];
ints[i+1]=agent;
}
}
}
return ints;
}
}
解释:外层循环1次,内层循环8次。外层一共循环8次,内层一共循环64次。因为最后一次不用排序!!!