public class 冒泡排序插入 {
public static void main(String[] args) {
System.out.println("请输入数组长度;");
Scanner sc = new Scanner(System.in) ;
int length = sc.nextInt();
int [] arr =new int [length] ;
System.out.println("请输入元素");
for (int i = 0; i < length; i++) {
arr[i]=sc.nextInt();
}
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i]);
}
}
public static void swap(int [] arr ,int i ,int j ) {
int num = arr[i] ;
arr[i]= arr[j] ;
arr[j]= num;
}
//选择排序
public static void selectionSort (int [] arr) {
if (arr.length<2||arr==null) {
return ;
}
for (int minIndex,i = 0; i < arr.length-1; i++) {
minIndex = i ;
for (int j = i+1; j < arr.length; j++) {
if (arr[minIndex]<arr[j]) {
minIndex= j ;
}
}
swap(arr, minIndex, i);
}
}
//冒泡排序
public static void bubblrSort(int[] arr) {
if (arr.length<2||arr==null) {
return ;
}
for (int i = arr.length-1; i >0; i++) {
for (int j = 0; j < arr.length-1; j++) {
if (arr[j]>arr[j+1]) {
swap(arr, j+1, j);
}
}
}
}
//插入排序
public static void insertionSort(int[] arr) {
if (arr.length<2||arr==null) {
return ;
}
for (int i = 1; i < arr.length-1; i++) {
for (int j = i-1; j>=0&&arr[j]>arr[j+1]; j--) {
swap(arr, j+1, j);
}
}
}
}