1.选择排序
代码:
import java.util.Arrays;
public class SelectionSort {
public static void main(String[] args) throws Exception {
int[] arr = {1,324,5,56,2,34,54};
System.out.println("排序后的数组为:"+SelectionSort(arr));
}
public static String SelectionSort(int[] arr) {
for (int i = 0; i < arr.length; i++) {
int minIndex = i;
for (int j = i; j < arr.length; j++) {
if (arr[j]<arr[minIndex]) {
minIndex = j;
}
}
int temp = arr[i];
arr[i] = arr[minIndex];
arr[minIndex] = temp;
}
return Arrays.toString(arr);
}
}
图示:
2.冒泡排序
代码:
import java.util.Arrays;
public class BubbleSort {
public static void main(String[] args) throws Exception {
int[] arr = {1,234,4,34,53,6,2};
System.out.println("排序后的数组为:"+BubbleSort(arr));
}
public static String BubbleSort(int[] arr) {
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < arr.length-1-i; j++) {
if (arr[j+1]<arr[j]) {
int temp = arr[j+1];
arr[j+1] = arr[j];
arr[j] = temp;
}
}
}
return Arrays.toString(arr);
}
}
图示:
3.插入排序
代码:
import java.util.Arrays;
public class InsertionSort {
public static void main(String[] args) throws Exception {
int[] arr = {1,34,5,65,3,56,44};
System.out.println(InsertionSort(arr));
}
public static String InsertionSort(int[] arr) {
int i,j,temp;
for(i=1;i<arr.length;i++) {
temp=arr[i];
for(j=i-1;j>=0;j--) {
if(temp>arr[j]) {
break;
}else {
arr[j+1]=arr[j];
}
}
arr[j+1]=temp;
}
return Arrays.toString(arr);
}
}
图示: