import java.util.Arrays;
public class Code_01_InsertionSort {
public static void insertionSort(int []arr){
if(arr==null||arr.length<1){
return;
}
for(int i=1;i<arr.length;i++){
for(int j=i-1;j>=0&&arr[j]>arr[j+1];j--){
swap(arr,j,j+1);
}
}
}
private static void swap(int[] arr, int j, int i) {
arr[i] = arr[i] ^ arr[j];
arr[j] = arr[i] ^ arr[j];
arr[i] = arr[i] ^ arr[j];
}
//for test
public static void comparator(int []arr){
Arrays.sort(arr);
}
//for test
public static int []generateRandomArray(int maxSize,int maxValue){
int []arr=new int[(int)((maxSize+1)*Math.random())];
for(int i=0;i<arr.length;i++){
arr[i]=(int)((maxSize+1)*Math.random())-(int)((maxSize)*Math.random());
}
return arr;
}
//for test
public static int[]copyArray(int []arr){
if(arr==null)
return null;
int []res=new int[arr.length];
for(int i=0;i<arr.length;i++){
res[i]=arr[i];
}
return res;
}
//for test
public static boolean isEqual(int []arr1,int[]arr2){
if((arr1==null&&arr2!=null)||(arr1!=null&&arr2==null)){
return false;
}
if(arr1==null&&arr2==null)
return true;
if(arr1.length!=arr2.length)
return false;
for (int i=0;i<arr1.length;i++){
if(arr1[i]!=arr2[i]){
return false;
}
}
return true;
}
//for test
public static void printArray(int []arr){
if(arr==null){
return;
}
for(int i=0;i<arr.length;i++){
System.out.print(arr[i]+" ");
}
System.out.println();
}
public static void main(String[] args) {
int testTime=500000;
int maxSize=100;
int maxValue=100;
boolean succeed=true;
for(int i=0;i<testTime;i++){
int []arr1=generateRandomArray(maxSize,maxValue);
int []arr2=copyArray(arr1);
insertionSort(arr1);
comparator(arr2);
if(!isEqual(arr1,arr2)){
succeed=false;
break;
}
}
System.out.println(succeed?"Nice !":"Fucing fucked!");
int []arr=generateRandomArray(maxSize,maxValue);
printArray(arr);
insertionSort(arr);
printArray(arr);
}
}
插入排序
最新推荐文章于 2023-09-05 15:37:33 发布