冒泡排序
public static void main(String[] args) {
int[] arr = {55, 35, 69, 11, 22, 66};
maoPao(arr);
System.out.println(Arrays.toString(arr));
}
private static void maoPao(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 temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}
}
选择排序
public static void main(String[] args) {
int[] arr = {55, 35, 69, 11, 22, 66};
xuanZe(arr);
System.out.println(Arrays.toString(arr));
}
private static void xuanZe(int[] arr) {
for (int index = 0; index < arr.length - 1; index++) {
for (int i = 1 + index; i < arr.length; i++) {
if (arr[index] > arr[i]) {
int t = arr[index];
arr[index] = arr[i];
arr[i] = t;
}
}
}
}
直接插入排序
public static void main(String[] args) {
int[] arr = {55, 35, 69, 11, 22, 66};
chaRu2(arr);
System.out.println(Arrays.toString(arr));
}
private static void chaRu1(int[] arr) {
for (int i = 1; i < arr.length; i++) {
for (int j = i; j > 0; j--) {
if (arr[j] < arr[j - 1]) {
int t = arr[j];
arr[j] = arr[j - 1];
arr[j - 1] = t;
}
}
}
}
private static void chaRu2(int[] arr) {
for (int i = 1; i < arr.length; i++) {
int j = i;
while (j > 0 && arr[j] < arr[j - 1]) {
int t = arr[j];
arr[j] = arr[j - 1];
arr[j - 1] = t;
j--;
}
}
}
希尔排序
public static void main(String[] args) {
int[] arr = {20, 14, 23, 55, 31, 1};
XiEr(arr);
System.out.println(Arrays.toString(arr));
}
private static void XiEr(int[] arr) {
for (int gap = arr.length / 2; gap > 0; gap /= 2) {
for (int i = gap; i < arr.length; i++) {
for (int j = i; j >= gap; j-=gap) {
if (arr[j] < arr[j-gap]){
int t = arr[j];
arr[j] = arr[j-gap];
arr[j-gap] = t;
}
}
}
}
}
快速排序
public static void main(String[] args) {
int[] arr = {55, 35, 69, 11, 22, 66};
kuaiPai(arr, 0, arr.length - 1);
System.out.println(Arrays.toString(arr));
}
public static void kuaiPai(int[] arr, int start, int end){
if (start < end) {
int index = getIndex(arr, start, end);
kuaiPai(arr, start, index - 1);
kuaiPai(arr, index + 1, end);
}
}
private static int getIndex(int[] arr, int start, int end) {
int i = start;
int j = end;
int x = arr[i];
while (i < j) {
while (i < j && x <= arr[j]) {
j--;
}
if (i < j) {
arr[i] = arr[j];
i++;
}
while (i < j && x > arr[i]) {
i++;
}
if (i < j) {
arr[j] = arr[i];
j--;
}
}
arr[i] = x;
return i;
}
二分查找
public static void main(String[] args) {
int[] arr = {10, 20, 30, 40, 50, 60, 70, 80, 90, 100};
int index = getIndex(arr, 30);
System.out.println(index);
}
private static int getIndex(int[] arr, int ele) {
int minIndex = 0;
int maxIndex = arr.length - 1;
int centerIndex = (maxIndex + minIndex) / 2;
while (minIndex <= maxIndex) {
if (ele == arr[centerIndex]) {
return centerIndex;
} else if (ele < arr[centerIndex]) {
maxIndex = centerIndex - 1;
} else if (ele > arr[centerIndex]) {
minIndex = centerIndex + 1;
}
centerIndex = (maxIndex + minIndex) / 2;
}
return -1;
}