#include <stdio.h>
#include <stdlib.h>
#define MAXSIZE 10
#define NotFound 0
typedef int ElementType;
typedef int Position;
typedef struct LNode *List;
struct LNode {
ElementType Data[MAXSIZE];
Position Last; /* 保存线性表中最后一个元素的位置 */
};
Position BinarySearch( List L, ElementType X );
int main()
{
List L;
ElementType X;
Position P;
L = ReadInput();
scanf("%d", &X);
P = BinarySearch( L, X );
printf("%d\n", P);
return 0;
}
Position BinarySearch(List L, ElementType X) {
int low = 0, high, middle;
high = L->Last;
while (low <= high) {
middle = (low + high) / 2;
if (L->Data[middle] > x) {
high = middle - 1;
}
else if (L->Data[middle] < x) {
low = middle + 1;
}
else {
return middle;
}
}
return NotFound;
}
线性表二分查找某个元素
最新推荐文章于 2024-05-19 20:00:00 发布