查找
文豪必上岸
这个作者很懒,什么都没留下…
展开
-
递归二分查找
#include<stdio.h> #include<math.h> int search(int A[],int key,int low,int high){ int mid; if(low<=high){ mid=(low+high)/2; if(low<=high && key<A[mid]){ printf("%d\n",A[mid]); search(A,key,low,mid-1); } else if(.原创 2021-11-11 22:55:47 · 192 阅读 · 0 评论 -
静态数组二分查找
#include <stdio.h> #include <stdlib.h> #define MaxSize 50 typedef struct{ int data[MaxSize]; int length; }Sqlist; bool ListInsert(Sqlist &L,int i,int e){ L.length=10; if(i<1 || i>L.length+1) //判断i的范围是否有效 return false; if(L.l.原创 2021-11-05 22:50:17 · 52 阅读 · 0 评论