From 04942ee6d83590180f089a006a5f3b976a8571ad Mon Sep 17 00:00:00 2001
From: LSM <1185424014@qq.com>
Date: Fri, 8 Jan 2021 23:50:43 +0800
Subject: [PATCH] dasds

---
 "\346\216\222\345\272\217.txt" | 169 +++++++++++++++++++++++++++++++++
 1 file changed, 169 insertions(+)
 create mode 100644 "\346\216\222\345\272\217.txt"

diff --git "a/\346\216\222\345\272\217.txt" "b/\346\216\222\345\272\217.txt"
new file mode 100644
index 0000000..01304d3
--- /dev/null
+++ "b/\346\216\222\345\272\217.txt"
@@ -0,0 +1,169 @@
+Ö±½Ó²åÈëÅÅÐò
+	public static void insertSort(int[] inputs){
+		int size = inputs.length;
+		for(int i=1; i<size; i++){
+			int temp = inputs[i];
+			int j=i-1;
+			for(; j>=0&&(inputs[j]>temp); j--){
+				inputs[j+1] = inputs[j];
+			}
+			inputs[j+1] = temp;
+		}
+	}
+Ï£¶ûÅÅÐò
+	public static void shellSort(int[] inputs){
+		int size = inputs.length;
+		int d=1;
+		while(d < size){
+			d = 3*d+1;
+		}
+		d = (d-1)/3;
+		while(d > 0){
+			for(int i=d; i<size; i++){
+				int temp = inputs[i];
+				int j = i-d;
+				for(; j>=0&&(inputs[j]>temp); j-=d){
+					inputs[j+d] = inputs[j];
+				}
+				inputs[j+d] = temp;
+			}
+			d = (d-1)/3;
+		}
+		
+	}
+Ö±½ÓÑ¡ÔñÅÅÐò
+	public static void selectSort(int[] inputs){
+		int size = inputs.length;
+		for(int i=0; i<size; i++){
+			int temp = inputs[i];
+			int min = temp;
+			int minIndex = i;
+			for(int j=i+1; j<size; j++){
+				if(min > inputs[j]){
+					min = inputs[j];
+					minIndex = j;
+				}
+			}
+			if(minIndex != i){
+				inputs[i] = inputs[minIndex];
+				inputs[minIndex] = temp;
+			}
+		}
+	}
+¶ÑÅÅÐò
+	public static void heapSort(int[] inputs){
+		int size = inputs.length;
+		for(int i=size; i>0; i--){
+			heapSortBuildHeap(inputs, i);
+			heapSortSwap(inputs, i-1);
+		}
+		
+	}
+	
+	private static void heapSortBuildHeap(int[] inputs, int end){
+		int size = end;
+		int start = size/2 - 1;
+		for(int i=start; i>=0; i--){
+			if(2*i+2<size){
+				if(inputs[2*i+1] > inputs[2*i+2]){
+					if(inputs[2*i+1] > inputs[i]){
+						int temp = inputs[2*i+1];
+						inputs[2*i+1] = inputs[i];
+						inputs[i] = temp;
+					}
+				}else{
+					if(inputs[2*i+2] > inputs[i]){
+						int temp = inputs[2*i+2];
+						inputs[2*i+2] = inputs[i];
+						inputs[i] = temp;
+					}
+				}
+			}else{
+				if(inputs[2*i+1] > inputs[i]){
+					int temp = inputs[2*i+1];
+					inputs[2*i+1] = inputs[i];
+					inputs[i] = temp;
+				}
+			}
+		}
+	}
+	private static void heapSortSwap(int[] inputs, int end){
+		int temp = inputs[end];
+		inputs[end] = inputs[0];
+		inputs[0] = temp;
+	}
+ðÅÝÅÅÐò
+	public static void buddleSort(int[] inputs){
+		int size = inputs.length;
+		for(int i=0; i<size; i++){
+			for(int j=1; j<size-i; j++){
+				if(inputs[j] < inputs[j-1]){
+					int temp = inputs[j];
+					inputs[j] = inputs[j-1];
+					inputs[j-1] = temp;
+				}
+			}
+		}
+	}
+¿ìËÙÅÅÐò
+	public static void quickSort(int[] inputs, int left, int right){
+		if(left >= right)
+			return;
+		int base = inputs[left];
+		int baseIndex = left;
+		int end = right;
+		while(left < right){
+			while(right>left && inputs[right]>=base){
+				right--;
+			}
+			inputs[left] = inputs[right];
+			while(left<right && inputs[left]<=base){
+				left++;
+			}
+			inputs[right] = inputs[left];
+		}
+		inputs[right] = base;
+		quickSort(inputs, baseIndex, right-1);
+		quickSort(inputs, right+1, end);
+	}
+¹é²¢ÅÅÐò
+	public static void mergeSort(int[] inputs, int low, int high){
+		if(low >= high){
+			return;
+		}
+		int mid = (low+high)/2;
+		mergeSort(inputs, low, mid);
+		mergeSort(inputs, mid+1, high);
+		merge(inputs, low, mid, high);
+	}
+	
+	private static void merge(int[] inputs, 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(inputs[i] <= inputs[j]){
+				temp[k] = inputs[i];
+				i++;
+			}else{
+				temp[k] = inputs[j];
+				j++;
+			}
+			k++;
+		}
+		while(i <= mid){
+			temp[k] = inputs[i];
+			k++;
+			i++;
+		}
+		while(j <= high){
+			temp[k] = inputs[j];
+			k++;
+			j++;
+		}
+		for(int m=0; m<temp.length; m++){
+			inputs[low+m] = temp[m];
+		}
+	}
+}
-- 
Gitee