查找（顺序）

#include<iostream>
#define Maxsize 50
using namespace std;
typedef int Elemtype;
typedef struct {
	Elemtype* elem;
	int length;
}SSTable;
void Create_Table(SSTable& S,int len) {
	S.elem = new Elemtype[len+1];
	S.length = len+1;
	for (int j = 1; j < S.length; j++) {
		cin >> S.elem[j];
	}
}
int Search_Table(SSTable S, Elemtype key) {
	S.elem[0] = key;
	int i = S.length-1;
	for (i; S.elem[i] != key; --i);
	return i;
}
void BubbleSort(SSTable &S) {
	int temp;
	for (int i = 1; i <S.length-1; i++) {
		for (int j = 1; j <=S.length - i -1 ; j++) {
			if (S.elem[j] > S.elem[j + 1]) {
				temp = S.elem[j];
				S.elem[j] = S.elem[j + 1];
				S.elem[j + 1] = temp;
			}
		}
	}
}
int Bin_Search(Elemtype key, SSTable S) {
	int low = 1;
	int high = S.length-1;
	int mid;
	while (low <= high) {
		mid = (low + high) / 2;
		if (key == S.elem[mid])
			return mid;
		else if (key < S.elem[mid])
			high = mid - 1;
		else
			low = mid + 1;
	}
	return -1;
}
int Binsearch(Elemtype key, SSTable S, int low, int high) {
	if (low > high)
		return -1;
	int mid = (low + high) / 2;
	if (key == S.elem[mid])
		return mid;
	else if (key < S.elem[mid])
		return(key, S, low, mid - 1);
	else
		return(key, S, mid + 1, high);
}
int main() {
	SSTable S;
	int i;
	cout << "请输入顺序表长度：" << endl;
	cin >> i;
	cout << "输入顺序表" << endl;
	Create_Table(S, i);
	int res;
	res = Search_Table(S, 15);
	cout<<"顺序查找元素位置是：" << res<<endl;
	BubbleSort(S);
	cout << "冒泡排序后的数组为：";
	for (int i = 1; i < S.length; i++) {
		cout << S.elem[i]<<" ";
	}
	int mid=Bin_Search(15, S);
	cout <<endl<< "数据二分查找后的位置是:(非递归)" << mid << endl;
	//
	int low = 1;
	int high = S.length - 1;
	int midd = Binsearch(15, S, low, high);
	cout << endl << "数据二分查找后的位置是:(递归)" << midd << endl;
}