线性表(al,a2,a3,,an)中的元素递增有序且按顺序存储于计算机内。要求设计一个算法完成用最少时间在表中查找数值为X的元素，若找到，则将其与后继元素位置相交换，若找不到，则将其插入表中

#include <stdio.h>

int length = 9;
int a[10]{ 1,2,3,4,5,6,7,8,9};

//输出顺序表
void SearchChange(int a[], int x) {
	int left = 0;
	int right = length - 1;
	int mid;
	while (left <= right) {
		mid = (left + right) / 2;
		if (a[mid] == x) {
			break;
		}
		else if (a[mid] < x) {
			left = mid + 1;
		}
		else {
			right = mid - 1;
		}
	}

	if (a[mid] == x && mid != length - 1) {
		int temp;
		temp = a[mid];
		a[mid] = a[mid + 1];
		a[mid + 1] = temp;
	}
	if (left > right) {
		int i;
		for ( i = length - 1; i > right; i--) {
			a[i + 1] = a[i];
		}
		a[i + 1] = x;
		length++;
	}

}

int main() {

	for (int i = 0; i <= length - 1; i++) {
		printf("%d", a[i]);
	}
	printf("\n");
	
	SearchChange(a, 6);

	for (int i = 0; i <= length - 1; i++) {
		printf("%d", a[i]);
	}
	printf("\n");

	return 0;
}