diff --git a/查找/顺序折半查找/P278.6.cpp b/查找/顺序折半查找/P278.6.cpp
new file mode 100644
index 0000000..f3c4972
--- /dev/null
+++ b/查找/顺序折半查找/P278.6.cpp
@@ -0,0 +1,74 @@
+#include <cstdio>
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+
+#pragma region 建立顺序存储的线性表
+
+#define MAX 30
+#define _for(i,a,b) for( int i=(a); i<(b); ++i)
+#define _rep(i,a,b) for( int i=(a); i<=(b); ++i)
+
+typedef struct {
+	int data[MAX];
+	int length;
+}List;
+
+void swap(int* a, int* b) {
+	int t;
+	t = *a;
+	*a = *b;
+	*b = t;
+}
+
+//给定一个List，传入List的大小，要逆转的起始位置
+void Reserve(List* list, int start, int end, int size) {
+	if (end <= start || end >= size) {
+		return;
+	}
+	int mid = (start + end) / 2;
+	_rep(i, 0, mid - start) {
+		swap(&list->data[start + i], &list->data[end - i]);
+	}
+}
+
+void PrintList(List list) {
+	_rep(i, 1, list.length) {
+		cout << list.data[i] << " ";
+	}
+	cout << endl;
+}
+
+#pragma endregion
+
+//P278.6
+//写出折半查找的递归算法。初始调用时,1ow为1,high为ST.length。
+
+int BinSearch(List list, int key, int low, int high) {
+	
+	// 返回key在表中的序号
+	if (low > high) {
+		return 0;
+	}
+	int mid = (low + high) / 2;
+	if (key > list.data[mid])
+		return BinSearch(list, key, mid + 1, high);
+	else if (key < list.data[mid])
+		return BinSearch(list, key, low, mid - 1);
+	else
+		return mid;
+}
+
+int main()
+{
+	List list;
+	list.length = 9;
+	int Data[] = { -99999,2,3,5,7,9,11,13,15,41 };
+	//顺序表的第0个位置不存数据
+	for (int i = 1; i <= list.length; i++)
+		list.data[i] = Data[i];
+	PrintList(list);
+	cout << "位置为：" << BinSearch(list, 15, 1, list.length) << endl;
+	return 0;
+}
\ No newline at end of file
diff --git a/查找/顺序折半查找/P278.7(1).cpp b/查找/顺序折半查找/P278.7(1).cpp
new file mode 100644
index 0000000..a60449c
--- /dev/null
+++ b/查找/顺序折半查找/P278.7(1).cpp
@@ -0,0 +1,79 @@
+#include <cstdio>
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+
+#pragma region 建立顺序存储的线性表
+
+#define MAX 30
+#define _for(i,a,b) for( int i=(a); i<(b); ++i)
+#define _rep(i,a,b) for( int i=(a); i<=(b); ++i)
+
+typedef struct {
+	int data[MAX];
+	int length;
+}List;
+
+void swap(int* a, int* b) {
+	int t;
+	t = *a;
+	*a = *b;
+	*b = t;
+}
+
+//给定一个List，传入List的大小，要逆转的起始位置
+void Reserve(List* list, int start, int end, int size) {
+	if (end <= start || end >= size) {
+		return;
+	}
+	int mid = (start + end) / 2;
+	_rep(i, 0, mid - start) {
+		swap(&list->data[start + i], &list->data[end - i]);
+	}
+}
+
+void PrintList(List list) {
+	_for(i, 0, list.length) {
+		cout << list.data[i] << " ";
+	}
+	cout << endl;
+}
+
+#pragma endregion
+
+//P278.7(1)
+//线性表中各结点的检索概率不等时,可用如下策略提高顺序检索的效率:若找到指定的
+//结点,则将该结点和其前驱结点(若存在)交换, 使得经常被检索的结点尽量位于表的
+//前端。试设计在顺序结构和链式结构的线性表上实现上述策略的顺序裣索算法。
+
+//顺序实现
+int Search(List &list, int key) {
+
+	int i = 0;
+	for (i; i < list.length && list.data[i] != key; i++);
+	if (i < list.length && i > 0) {
+		swap(list.data[i], list.data[i - 1]);
+		return --i;
+	}
+	return -1;
+}
+
+int main()
+{
+	List list;
+	list.length = 9;
+	int Data[] = {2,3,5,7,9,11,13,15,41 };
+	//顺序表的第0个位置不存数据
+	for (int i = 0; i < list.length; i++)
+		list.data[i] = Data[i];
+	PrintList(list);
+	cout << "位置为：" << Search(list, 9) << endl;
+	cout << "位置为：" << Search(list, 9) << endl;
+	cout << "位置为：" << Search(list, 9) << endl;
+	cout << "位置为：" << Search(list, 9) << endl;
+	cout << "位置为：" << Search(list, 13) << endl;
+	cout << "位置为：" << Search(list, 13) << endl;
+	PrintList(list);
+	return 0;
+}
\ No newline at end of file
diff --git a/查找/顺序折半查找/P278.7(2).cpp b/查找/顺序折半查找/P278.7(2).cpp
new file mode 100644
index 0000000..ff1411f
--- /dev/null
+++ b/查找/顺序折半查找/P278.7(2).cpp
@@ -0,0 +1,102 @@
+#include <iostream>
+#include <vector>
+using namespace std;
+
+#pragma region ������ͷ��������
+
+#define ElemType int
+#define _for(i,a,b) for(int i=(a);i<(b);i++)
+
+typedef struct LNode {
+	ElemType data;
+	struct LNode* next;
+}LNode, * LinkList;
+
+//��ʼ������
+bool InitList(LinkList& L) {
+	//����һ��ͷ���
+	L = (LNode*)malloc(sizeof(LNode));
+	//�ڴ治�㣬����ʧ��
+	if (L == NULL) {
+		return false;
+	}
+	//ͷ���֮����ʱ��û�нڵ�
+	L->next = NULL;
+	return true;
+}
+
+
+//�ж��Ƿ�Ϊ��
+bool IsEmpty(LinkList L) {
+	return ((L->next) == NULL);
+}
+
+//ʹ��β�巨����
+LinkList CreatList(vector<int> data) {
+	if (data.size() < 1) {
+		return NULL;
+	}
+	//ͷ���
+	LNode* head = (LinkList)malloc(sizeof(LNode));
+	head->data = NULL;
+	head->next = NULL;
+	LinkList p = head;
+	_for(i, 0, data.size()) {
+		LNode* s = (LinkList)malloc(sizeof(LNode));
+		s->data = data[i];
+		s->next = NULL;
+		p->next = s;
+		p = s;
+	}
+	return head;
+}
+//�������
+void PrintList(LinkList list) {
+	list = list->next;
+	while (list != NULL) {
+		printf("%d ", list->data);
+		list = list->next;
+	}
+	printf("\n");
+}
+
+#pragma endregion
+
+//P278.7(2)
+//���Ա��и����ļ������ʲ���ʱ,�������²������˳�������Ч��:���ҵ�ָ����
+//���,�򽫸ý�����ǰ�����(������)����, ʹ�þ����������Ľ�㾡��λ�ڱ���
+//ǰ�ˡ��������˳��ṹ����ʽ�ṹ�����Ա���ʵ���������Ե�˳�������㷨��
+
+//��ʽʵ��
+
+int Search(LinkList &head,ElemType key) {
+
+	int i = 0;
+	LinkList p = head->next,pre=head;
+	while (p && p->data != key) {
+		i++;
+		pre = p;
+		p = p->next;
+	}
+	if (p) {
+		swap(p->data, pre->data);
+		return --i;
+	}
+	return -1;
+}
+
+int main()
+{
+	vector<int> data{ 2,4,6,8,13,23,36,41,63 };
+	LinkList head;
+	InitList(head);
+	head = CreatList(data);
+	PrintList(head);
+	cout << "���" << Search(head, 8) << endl;
+	cout << "���" << Search(head, 8) << endl;
+	cout << "���" << Search(head, 8) << endl;
+	cout << "���" << Search(head, 41) << endl;
+	cout << "���" << Search(head, 41) << endl;
+	PrintList(head);
+	return 0;
+}