冒泡排序
package com.gaj.day05;
public class BubbleSort {
public static void main(String[] args) {
int[] arr = new int[]{23, 21, 28, 18, 3, 20, 3};
bubbleSort(arr);
show(arr);
}
public static void bubbleSort(int[] arr){
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]){
swap(arr, j);
}
}
}
}
public static void swap(int arr[], int a){
int temp = arr[a];
arr[a] = arr[a + 1];
arr[a + 1] = temp;
}
public static void show(int [] arr){
for (int i : arr) {
System.out.print(i + "\t");
}
System.out.println();
}
}
选择排序
package com.gaj.day05;
public class SelectSort {
public static void main(String[] args) {
int[] arr = new int[]{23, 21, 28, 18, 3, 20, 3};
selectSort(arr);
show(arr);
}
public static void selectSort(int[] arr){
for(int i = 0; i < arr.length - 1; i++){
for(int j = i + 1; j < arr.length; j ++){
if(arr[i] > arr[j]){
swap(arr, i, j);
}
}
}
}
public static void swap(int arr[], int a, int b){
int temp = arr[a];
arr[a] = arr[b];
arr[b] = temp;
}
public static void show(int [] arr){
for (int i : arr) {
System.out.print(i + "\t");
}
System.out.println();
}
}
插入排序
package com.gaj.day05;
public class InsertSort {
public static void main(String[] args) {
int[] arr = new int[]{23, 21, 28, 18, 3, 20, 3};
insertSort(arr);
show(arr);
}
public static void insertSort(int[] arr){
for(int i = 1; i < arr.length; i ++ ){
for(int j = 0; j < i; j++){
if(arr[i] < arr[j]){
swap(arr, i, j);
}
}
}
}
public static void swap(int arr[], int a, int b){
int temp = arr[a];
for(int k = a; k > b; k--){
arr[k] = arr[k - 1];
}
arr[b] = temp;
}
public static void show(int [] arr){
for (int i : arr) {
System.out.print(i + "\t");
}
System.out.println();
}
}