1、选择排序
public class SelectSortTest {
public static void main(String[] args) {
System.out.println("数据结构和算法--选择排序");
int[] array = {38,65,97,76,13,27,49,11};
selectSort(array);
for(int i = 0;i<array.length;i++) {
System.out.print(array[i]+"\t");
}
}
public static void selectSort(int[] arr) {
int i,j;
int flag = 0;
int temp = 0;
int len = arr.length;
for(i=0;i<len;i++) {
flag = i;
temp = arr[i];
for(j=i+1;j<len;j++) {
if(temp>arr[j]) {
flag=j;
temp=arr[j];
}
}
if(flag!=i) {
arr[flag]=arr[i];
arr[i] = temp;
}
}
}
}
2、插入排序
public class InsertSortTest {
public static void main(String[] args) {
int[] array = {38,65,97,76,13,27,49,11};
System.out.println("数据结构与算法-->插入排序:");
insertSort(array);
for(int i=0;i<array.length;i++) {
System.out.print(array[i]+"\t");
}
}
public static void insertSort(int[] arr) {
int i,j;
int len = arr.length;
int temp = 0;
for(i=1;i<len;i++) {
temp = arr[i];
j = i;
if(arr[j-1]>temp) {
while(j>=1 && arr[j-1]>temp) {
arr[j] = arr[j-1];
j--;
}
}
arr[j] = temp;
}
}
}
3、归并排序
public class MergeTest2 {
public static void main(String[] args) {
int[] array = {5,4,9,8,7,6,0,1,3,2};
System.out.println(Arrays.toString(array));
mergeSort(array,0,array.length-1);
System.out.println(Arrays.toString(array));
}
public static void merge(int[] array,int low,int mid,int height) {
int s1 = low;
int s2 = mid+1;
int[] temp = new int[height-low+1];
int i = 0;
while(s1<=mid && s2<=height) {
if(array[s1]<=array[s2]) {
temp[i++] = array[s1++];
}else {
temp[i++] = array[s2++];
}
}
while(s1<=mid) {
temp[i++] = array[s1++];
}
while (s2 <= height) {
temp[i++] = array[s2++];
}
for(int j= 0;j<temp.length;j++) {
array[j+low] = temp[j];
}
}
public static void mergeSort(int[] array,int low,int height) {
if(low>=height) {
return;
}
int mid = (low+height)>>>1;
mergeSort(array,low,mid);
mergeSort(array,mid+1,height);
merge(array,low,mid,height);
}
}
4、冒泡排序
public class BubbleSortTest {
public static void main(String[] args) {
int[] array = {5,4,9,8,7,6,0,1,3,2};
bubbleSort(array);
System.out.println("冒泡排序:");
for(int k=0;k<array.length;k++) {
System.out.print(array[k]+"\t");
}
}
public static void bubbleSort(int[] arr) {
int i,j;
int len = arr.length-1;
int temp;
for(i=0;i<len;i++) {
for(j=len;j>i;--j) {
if(arr[j]<arr[j-1]) {
temp = arr[j];
arr[j] = arr[j-1];
arr[j-1] = temp;
}
}
}
}
}
5、快速排序
public class QuickSortTest {
public static void main(String[] args) {
int[] array = {5, 4, 9, 8, 7, 6, 0, 1, 3, 2};
quickSort(array,0,array.length-1);
for(int i=0;i<array.length;i++) {
System.out.print(array[i]+" ");
}
}
public static void quickSort(int[] arr,int left,int right) {
if(left>right) {
return;
}
int base = arr[left];
int i = left;
int j = right;
while(i !=j) {
while(arr[j]>=base && i<j) {
j--;
}
while(arr[i]<=base && i< j) {
i++;
}
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
arr[left] = arr[i];
arr[i] = base;
quickSort(arr,left,i-1);
quickSort(arr,i+1,right);
}
}