1.排序分类:
1)冒泡排序
import java.util.Arrays;
public class BubbleSort {
public static void main(String[] args) {
int[] arr=new int[] {1,4,8,3,666,36,76,43,24,3,45};
BubbleSort b=new BubbleSort();
b.BubbleSort(arr);
System.out.println(Arrays.toString(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]){
int tmp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=tmp;
}
}
}
}
}
2)快速排序:
import java.util.Arrays;
public class QuickSort {
public static void main(String[] args) {
// 给定要排序的数组
int[] arr=new int[] {1,4,21,7,0,3,6,2,10,4,5,9,1};
quickSort(arr,0,arr.length-1);
System.out.println(Arrays.toString(arr));
}
public static void quickSort(int[] arr,int start,int end) {
if(start<end) {
int stard=arr[start];
int low=start;
int high=end;
while(low<high){
while(low<high&&arr[high]>=stard) {
high--;
}
arr[low]=arr[high];
while(low <high&&arr[low]<=stard) {
low++;
}
arr[high]=arr[low];
}
arr[low]=stard;
quickSort(arr,start,low);
quickSort(arr,low+1,end);
}}
}