数据结构——二分查找

顺序表的相关操作参见https://blog.csdn.net/qq_40280704/article/details/105916485

//二分查找
#include <stdio.h>
#include <stdlib.h>
#define MaxSize 50 
typedef struct{
	int *elem; 
	int MaxSize,TableLen;	
}SeqList; 

int Binary_Search(SeqList L,int key){
	int low=0,high=L.TableLen-1,mid;
	while(low<=high){
		mid=(low+high)/2;
		if(L.elem[mid]==key){
			return mid;
		}
		else if(L.elem[mid]<key){
			low = mid+1;
		}
		else{
			high = mid-1;
		}
	}
	return -1;
}