【C學(xué)習(xí)筆記】day5-2 寫(xiě)代碼可以在整型有序數(shù)組中查找想要的數(shù)字, 找到了返回下標(biāo),找不到返回-1.(折半查找)
#include <stdio.h> #include <stdlib.h> int find(int s) { int n = 0; scanf_s("%d",&s); int a[100] = { 213,432,5436,765324,243,654,12387,87626,645,625,5234,246 }; for (int i = 0; i < 100; i++) { if (s == a[i]) { return i; break; } else n++; } if (n == 100) return -1; } int main() { while (1) { int m = find(0); printf_s("%d\n", m); } return 0; }


浙公網(wǎng)安備 33010602011771號(hào)