冒泡排序
import java.util.Arrays;
public class MyTest2 {
public static void main(String[] args) {
int[] arr = {23, 12, 42, 11, 25, 32};
for (int i = 0; i < arr.length - 1; i++) {
for (int j = 0; j < arr.length - 1 - i; j++) {
if (arr[j] > arr[j + 1]) {
int t = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = t;
}
}
}
System.out.println(Arrays.toString(arr));
}
}
选择排序
import java.util.Arrays;
public class MyTest2 {
public static void main(String[] args) {
int[] arr = {23, 12, 42, 11, 25, 32};
for (int i = 0; i < arr.length - 1; i++) {
for (int j = 1 + i; j < arr.length; j++) {
if (arr[i] > arr[j]) {
int t = arr[i];
arr[i] = arr[j ];
arr[j] = t;
}
}
}
System.out.println(Arrays.toString(arr));
}
}
直接插入法
import java.util.Arrays;
public class MyTest2 {
public static void main(String[] args) {
int[] arr = {23, 12, 42, 11, 25, 32};
for (int i = 1; i < arr.length; i++) {
int j = i;
while (j > 0 &&arr[j]< arr[j-1]){
int t = arr[j];
arr[j] =arr[j -1];
arr[j-1] = t;
j--;
}
}
System.out.println(Arrays.toString(arr));
for (int i = 0; i < arr.length; i++) {
for (int j = i; j > 0; j--) {
if (arr[j]< arr[j-1]){
int t = arr[j];
arr[j] =arr[j -1];
arr[j-1] = t;
j--;
}
}
}
System.out.println(Arrays.toString(arr));
}
}