package sjjg.sf;
import java.text.SimpleDateFormat;
import java.util.Date;
public class lx {
public static void main(String[] args) {
//冒泡排序 的时间复杂度0(n^2)
// int arr[] = {3,9,-1,10,-2};
// System.out.println("排序前");
// System.out.println(Arrays.toString(arr));
int[] arr = new int[80000];
for (int i=0;i < 80000;i++){
arr[i] = (int)(Math.random() * 8000000);
}
Date date1 = new Date();
SimpleDateFormat simpleDateFormat = new SimpleDateFormat("yyyy-mm-dd HH:mm:ss");
String date1str = simpleDateFormat.format(date1);
System.out.println("排序前时间"+date1str);
lx(arr);
Date date2 = new Date();
String date2str = simpleDateFormat.format(date2);
System.out.println("排序后时间"+date2str);
// System.out.println("排序后");
// System.out.println(Arrays.toString(arr));
}
public static void lx(int[] arr){
int adc = 0;
boolean flag = false;
for (int j = 0; j < arr.length -1; j++) {
for (int i = 0; i < arr.length - 1; i++) {
if (arr[i] > arr[i + 1]) {
flag = true;
adc = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = adc;
}
}
// System.out.println("第"+(j+1)+"趟排序的数组");
// System.out.println(Arrays.toString(arr));
if (!flag){
break;
}else {
flag = false;
}
}
}
}
冒泡排序
最新推荐文章于 2024-09-15 19:46:31 发布