// 普通查找
public int comSearch(int[] arr, int tag) {
for (int i = 0; i < arr.length; i++) {
if (arr[i] == tag) {
return i;
}
}
return -1;
}
// 二分查找
public int binSearch(int[] arr, int tag) {
int startIndex = 0;
int endIndex = arr.length;
int midIndex = (startIndex + endIndex) / 2;
while (startIndex < endIndex) {
if (tag > arr[midIndex]) {
startIndex = midIndex;
} else if (tag < arr[midIndex]) {
endIndex = midIndex;
} else {
return midIndex;
}
midIndex = (startIndex + endIndex) / 2;
}
return -1;
}
//冒泡排序
public static void main(String[] args) {
int[] arr = {5, 3, 6, 9, 4, 7, 8, 2, 1};
for (int i = 0; i < arr.length - 1; i++) {
for (int j = 0; j < arr.length - i - 1; j++) {
int temp;
if (arr[j] > arr[j + 1]) {
temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
for (int i : arr) {
System.out.println(i);
}
}
//选择排序
public static void main(String[] args) {
int[] arr = {5, 3, 6, 9, 4, 7, 8, 2, 1};
for (int i = 0; i < arr.length; i++) {
int temp = i;
for (int j = i + 1; j < arr.length; j++) {
if (arr[temp] > arr[j]) {
temp = j;
}
}
//if (arr[temp] < arr[i]) {
int zj = arr[i];
arr[i] = arr[temp];
arr[temp] = zj;
//}
}
for (int i : arr) {
System.out.println(i);
}
}
//插入排序
public static void main(String[] args) {
int[] arr = {5, 3, 6, 9, 4, 7, 8, 2, 1};
for (int i = 0; i < arr.length - 1; i++) {
for (int j = i + 1; j > 0; j--) {
if (arr[j] < arr[j - 1]) {
int temp = arr[j - 1];
arr[j - 1] = arr[j];
arr[j] = temp;
}
}
}
for (int i : arr) {
System.out.println(i);
}
}