摘要:
1、递归做阶乘 #include<stdio.h> int func1(int x) { int z = 0; while (x > 1) { int y = x - 1; z = x * func1(y); return z; } } int main() { int a = 0; scanf_s 阅读全文
摘要:
1、通过自定义函数做二分查找 #include<stdio.h> int binary_search(int arr[], int x, int sz) { int left = 0; int right = sz - 1; while (left <= right) { int mid = (le 阅读全文
摘要:
1、二分查找(折半查找) #include<stdio.h> int main() { int arr[] = { 1,2,3,4,5,6,7,8,9,10 }; int left = 0; int sz = sizeof(arr) / sizeof(arr[0]); int right = sz 阅读全文