#include <iostream>
#include <malloc.h>

using namespace std;

#define MAXL 100
typedef int KeyType;
typedef char InfoType;

typedef struct {
	KeyType key;//关键字
	InfoType data;//其他数据项
}RecType;

void CreateList(RecType R[], KeyType keys[], int n) {//创建顺序表
	for (int i = 0; i < n; i++) {
		R[i].key = keys[i];
	}
}

void DispList(RecType R[], int n) {//输出顺序表
	for (int i = 0; i < n; i++) {
		cout << R[i].key << " ";
	}
	cout << endl;
}

int SeqSearch(RecType R[], int n, KeyType k) {//查找
	int i = 0;
	while (i < n && R[i].key != k) {
		cout << R[i].key << " ";
		i++;
	}
	if (i >= n)
		return 0;
	else {
		cout << R[i].key << " ";
		return i + 1;
	}
}


int main() {
	RecType R[MAXL];
	int n = 10, i;
	KeyType k = 5;
	int a[] = { 3,6,2,10,1,8,5,7,4,9 };
	CreateList(R, a, n);
	cout << "关键字序列：";
	DispList(R, n);
	cout << "查找" << k << "所比较的关键字:" << endl;

	if ((i = SeqSearch(R, n, k)) != 0)
		cout << "\n元素" << k << "的位置是" << i << endl;
	else
		cout << "\n元素" << k << "不在表中" << endl;

	return 1;
}