冒泡排序
package org.xx.demo4;
import java.util.Arrays;
public class BubbleSort {
public static void main(String[] args) {
int[] arr = new int[]{32,2131,1231,12,431,121};
sort(arr);
System.out.println(Arrays.toString(arr));
}
public static void sort(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 mid = arr[j];
arr[j] = arr[j+1];
arr[j+1] = mid;
}
}
}
}
}
插入排序
package org.xx.demo4;
import java.util.Arrays;
public class InsertSort {
public static void main(String[] args) {
int[] arr = new int[]{32,2131,1231,12,431,121};
sort(arr);
System.out.println(Arrays.toString(arr));
}
public static void sort(int[] arr) {
for (int i = 1; i < arr.length; i++) {
if (arr[i]<arr[i-1]) {
int temp = arr[i];
int j;
for(j=i-1;j>=0&&arr[j]>temp;j--){
arr[j+1] = arr[j];
}
arr[j+1] = temp;
}
}
}
}
快速排序
package org.xx.demo4;
import java.util.Arrays;
public class QuickSort {
public static void main (String[] args){
int[] arr = new int[]{32,2131,1231,12,431,121};
sort(arr, 0, arr.length-1);
System.out.println(Arrays.toString(arr));
}
public static void sort(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;
sort(arr, start, low);
sort(arr, low+1, end);
}
}
}
希尔排序
package org.xx.demo4;
import java.util.Arrays;
public class SheelSort {
public static void main(String[] args) {
int[] arr = new int[]{32,2131,1231,12,431,121};
sort(arr);
System.out.println(Arrays.toString(arr));
}
public static void sort(int[] arr) {
for (int d = arr.length/2; d>0; d/=2) {
for (int i = d; i < arr.length; i++) {
for (int j = i-d; j>=0; j-=d) {
if (arr[j]>arr[j+d]) {
int temp = arr[j];
arr[j] = arr[j+d];
arr[j+d] = temp;
}
}
}
}
}
}
选择排序
package org.xx.demo4;
import java.util.Arrays;
public class SelectSort {
public static void main(String[] args) {
int[] arr = new int[]{32,2131,1231,12,431,121};
sort(arr);
System.out.println(Arrays.toString(arr));
}
public static void sort(int[] arr){
for(int i = 0;i<arr.length;i++){
int minIndex = i;
for(int j=i+1;j<arr.length;j++){
if (arr[minIndex]>arr[j]) {
minIndex = j;
}
}
if (i!=minIndex) {
int temp = arr[i];
arr[i] = arr[minIndex];
arr[minIndex] = temp;
}
}
}
}
归并排序
package org.xx.demo4;
import java.util.Arrays;
public class MergeSort {
public static void main(String[] args) {
int[] arr = new int[]{32,2131,1231,12,431,121};
mergeSort(arr, 0, arr.length-1);
System.out.println(Arrays.toString(arr));
}
public static void mergeSort(int[] arr,int low,int high) {
int middle=(high+low)/2;
if(low<high) {
mergeSort(arr, low, middle);
mergeSort(arr, middle+1, high);
merge(arr,low,middle,high);
}
}
public static void merge(int[] arr,int low,int middle, int high) {
int[] temp = new int[high-low+1];
int i=low;
int j=middle+1;
int index=0;
while(i<=middle&&j<=high) {
if(arr[i]<=arr[j]) {
temp[index]=arr[i];
i++;
}else {
temp[index]=arr[j];
j++;
}
index++;
}
while(j<=high) {
temp[index]=arr[j];
j++;
index++;
}
while(i<=middle) {
temp[index]=arr[i];
i++;
index++;
}
for(int k=0;k<temp.length;k++) {
arr[k+low]=temp[k];
}
}
}
基数排序
package org.xx.demo4;
import java.util.Arrays;
public class RadixSort {
public static void main(String[] args) {
int[] arr = new int[]{32,2131,1231,12,431,121};
radixSort(arr);
System.out.println(Arrays.toString(arr));
}
public static void radixSort(int[] arr){
int max = Integer.MIN_VALUE;
for(int i=0;i<arr.length;i++){
if (arr[i]>max) {
max=arr[i];
}
}
int maxLength = (max+"").length();
int[][] temp = new int[10][arr.length];
int[] counts = new int[10];
for(int i=0,n=1;i<maxLength;i++,n*=10){
for(int j=0;j<arr.length;j++){
int ys = arr[j]/n%10;
temp[ys][counts[ys]] = arr[j];
counts[ys]++;
}
int index = 0;
for(int k=0;k<counts.length;k++){
if (counts[k]!=0) {
for(int l=0;l<counts[k];l++){
arr[index] = temp[k][l];
index++;
}
counts[k]=0;
}
}
}
}
}
基数排序之队列实现
package org.xx.demo4;
import java.util.Arrays;
import org.xx.demo2.MyQueue;
public class RadixQueueSort2 {
public static void main(String[] args) {
int[] arr = new int[]{32,2131,1231,12,431,121};
radixSort(arr);
System.out.println(Arrays.toString(arr));
}
public static void radixSort(int[] arr){
int max = Integer.MIN_VALUE;
for(int i=0;i<arr.length;i++){
if (arr[i]>max) {
max=arr[i];
}
}
int maxLength = (max+"").length();
MyQueue[] temp = new MyQueue[10];
for(int i=0;i<temp.length;i++){
temp[i] = new MyQueue();
}
for(int i=0,n=1;i<maxLength;i++,n*=10){
for(int j=0;j<arr.length;j++){
int ys = arr[j]/n%10;
temp[ys].add(arr[j]);
}
int index = 0;
for(int k=0;k<temp.length;k++){
while(!temp[k].isEmpty()){
arr[index] = temp[k].poll();
index++;
}
}
}
}
}
堆排序
package org.xx.demo4;
import java.util.Arrays;
public class HeapSort {
public static void main(String[] args) {
int[] arr = new int[]{9,6,8,7,0,1,10,4,2};
heapSort(arr);
System.out.println(Arrays.toString(arr));
}
public static void heapSort(int[] arr){
int start = (arr.length-1)/2;
for(int i=start;i>=0;i--){
maxHeap(arr, arr.length, i);
}
for(int i=arr.length-1;i>0;i--){
int temp = arr[0];
arr[0] = arr[i];
arr[i] = temp;
maxHeap(arr, i, 0);
}
}
public static void maxHeap(int[] arr,int size,int index){
System.out.println(index);
int leftNode = 2*index+1;
int rightNode = 2*index+2;
int max = index;
if (leftNode<size&&arr[leftNode]>arr[max]) {
max = leftNode;
}
if (rightNode<size&&arr[rightNode]>arr[max]) {
max = rightNode;
}
if (max!=index) {
int temp = arr[index];
arr[index] = arr[max];
arr[max] = temp;
maxHeap(arr, size, max);
}
}
}