public class Sort {
//插入排序
static int[] insertSort(int[] a){
int i,j;
int insertNote;//要插入的数据
int[] array=a;
for (i=1;i<array.length;i++)
{
insertNote = array[i];
j=i-1;
while(j>=0&&insertNote<array[j])
{
array[j+1]=array[j];
j--;
}
array[j+1]=insertNote;
}
System.out.println(Arrays.toString(array));
return array;
}
//归并排序
public static int[] mergeSort(int[] nums, int low, int high) {
int mid = (low + high) / 2;
if (low < high) {
// 左边
mergeSort(nums, low, mid);
// 右边
mergeSort(nums, mid + 1, high);
// 左右归并
merge(nums, low, mid, high);
}
return nums;
}
public static void merge(int[] nums, int low, int mid, int high) {
int[] temp = new int[high - low + 1];
int i = low;// 左指针
int j = mid + 1;// 右指针
int k = 0;
// 把较小的数先移到新数组中
while (i <= mid && j <= high) {
if (nums[i] < nums[j]) {
temp[k++] = nums[i++];
} else {
temp[k++] = nums[j++];
}
}
// 把左边剩余的数移入数组
while (i <= mid) {
temp[k++] = nums[i++];
}
// 把右边边剩余的数移入数组
while (j <= high) {
temp[k++] = nums[j++];
}
// 把新数组中的数覆盖nums数组
for (int k2 = 0; k2 < temp.length; k2++) {
nums[k2 + low] = temp[k2];
}
}
//快速排序
public static int partition(int []array,int lo,int hi){
//固定的切分方式
int key=array[lo];
while(lo<hi){
while(array[hi]>=key&&hi>lo){//从后半部分向前扫描
hi--;
}
array[lo]=array[hi];
while(array[lo]<=key&&hi>lo){//从前半部分向后扫描
lo++;
}
array[hi]=array[lo];
}
array[hi]=key;
return hi;
}
public static void quickSort(int[] array,int lo ,int hi){
if(lo>=hi){
return ;
}
int index=partition(array,lo,hi);
quickSort(array,lo,index-1);
quickSort(array,index+1,hi);
// System.out.println(Arrays.toString(array));
}
//计数排序
public static int[] countSort(int[] arr){
if (arr == null || arr.length == 0) {
return null;
}
int max = Integer.MIN_VALUE;
int min = Integer.MAX_VALUE;
//找出数组中的最大最小值
for(int i = 0; i < arr.length; i++){
max = Math.max(max, arr[i]);
min = Math.min(min, arr[i]);
}
int help[] = new int[max];
//找出每个数字出现的次数
for(int i = 0; i < arr.length; i++){
int mapPos = arr[i] - min;
help[mapPos]++;
}
int index = 0;
for(int i = 0; i < help.length; i++){
while(help[i]-- > 0){
arr[index++] = i+min;
}
}
return arr;
}
//基数排序
static void radixSort(int[] array, int d){
int k= 0;
int n= 1;
int m= 1;
int[][] temp = new int[array.length][array.length];
int[] order = new int[array.length];
while(m <= d) {
for (int i = 0; i < array.length; i++) {
int lsd = ((array[i] / n) % 10);
temp[lsd][order[lsd]] = array[i];
order[lsd]++;
}
for (int i = 0; i < d; i++) {
if (order[i] != 0) for (int j = 0; j < order[i]; j++) {
array[k] = temp[i][j];
k++;
}
order[i] = 0;
}
n*= 10;
k= 0;
m++;
}
System.out.println(Arrays.toString(array));
return;
}
//桶排序
public static int[] bucketSort(int[] nums, int maxNum){
int[] sorted = new int[maxNum+1];
for(int i=0; i<nums.length; i++){
sorted[nums[i]] = nums[i];//把数据放到对应索引的位置
}
return sorted;
}
public static void main(String[] args) {
//
int num[]={32,53,13,24,65,10,12,14,16,22};
// int[] b=new int [a.length];
insertSort(num);
System.out.println("\n");
int[] c = { 2, 7, 8, 3, 1, 6, 9, 0, 5};
mergeSort(c, 0, c.length-1);
for(int i = 0; i < c.length; i++){
System.out.print(c[i]+", ");
}
System.out.println("\n");
int[] b={3,2,4,7,8,9,0};
quickSort(b,0,b.length-1);
System.out.println(Arrays.toString(b));
System.out.println("\n");
int a[]={99,65,24,47,50,88,33,66,67,31,18};
int[] sort=bucketSort(a,99);
for(int i=0;i<sort.length;i++){
if(sort[i]>0){
System.out.print(sort[i]+" ");
}
}
System.out.println("\n");
radixSort(a,10);
}
}