算法展示:
一分钟掌握“插入排序”
(本视频来自网络,仅供个人观赏学习交流,请勿转载或商用。)
Java代码实现:
import java.util.Arrays;
public class insertionSort {
//主方法
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~" : "Fucking fucked!");
}
//插入排序
public static void insertionSort(int[] nums){
if(nums.length <= 1){
return;
}
for(int i = 1; i < nums.length; i++){
for(int j = i-1; j >= 0; j--){
if(nums[j] > nums[i]){
swap(nums,i,j);
break;
}
}
}
}
//位运算交换
public static void swap(int[] nums, int index1, int index2){
nums[index1] ^= nums[index2];
nums[index2] ^= nums[index1];
nums[index1] ^= nums[index2];
}
//随机数组生成器
public static int[] generateRandomArray(int maxSize, int maxValue){
int[] arr = new int[(maxSize + 1) * (int)(Math.random())];
for(int i = 0; i < arr.length; i++){
arr[i] = ((int)Math.random() * (maxValue + 1)) - (int)Math.random() * maxValue;
}
return arr;
}
//数组复制
public static int[] copyArray(int[] arr){
if(arr == null){
return null;
}
return arr;
}
//比对
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;
}
for(int i = 0; i < arr1.length; i++){
if(arr1[i] != arr2[i]){
return false;
}
}
return true;
}
//对数器
public static void comparator(int[] nums){
Arrays.sort(nums);
}
}