1、找数算法:
定义一个递增的数组arr[ ],定义一个目标查找值target,找到arr[ ]中首次出现target的下标,如果不存在target则返回-1
(1)直接查找法:
遍历数组寻找目标查找值,遍历过程中出现目标值则返还对应下标,如果遍历整个数组后依旧没有的话则返还-1,代码实现如下:
#include<stdio.h>
int SimpleFind(const int* arr, int target,int size);
int main() {
int nums[] = { -1,0,3,5,9,12 };
int target = 9;
int size = sizeof(nums) / sizeof(int);
printf("简单查找的结果:%d\n", SimpleFind(nums, target, size));
}
int SimpleFind(const int* arr, int target, int size){
for (int i = 0; i < size; i++) {
if (arr[i] == target) {
return i;
}
}
return -1;
}
(2)二分查找法:
定义左端点和右端点,二者相加除以二得到中值,我们可以根据中值与目标值得大小关系来修改左端值或右端值,从而逼近目标值,最终返还下标,如果最终右端值比左端值小则跳出循环并返还-1,代码实现如下:
#include<stdio.h>
int BinaryFind(const int* arr, int target, int size);
int main() {
int nums[] = { -1,0,3,5,9,12 };
int target = 5;
int size = sizeof(nums) / sizeof(int);
printf("二分查找的结果:%d", BinaryFind(nums, target, size));
}
int BinaryFind(const int* arr, int target, int size) {
int left = 0, right = size - 1;
while (left <= right) {
int mid = (left + right) / 2;
if (arr[mid] == target) return mid;
else if (target > arr[mid]) left = mid + 1;
else if (target < arr[mid])right = mid - 1;
}
return -1;
}