用最少时间找线性表中的x,并与后继元素交换。
二分法查找元素
#include<iostream>
#include<stdlib.h>
#define Size 19
using namespace std;
typedef struct Table {
int* head;
int length;
int size;
}table;
table InitTable()
{
table t;
t.head = (int*)malloc(Size * sizeof(int));
if (!t.head)
{
printf("创建空间失败");
return t;
}
t.length = 0;
t.size = Size;
return t;
}
int BrinarySearchTable(table &t, int x)
{
int high = t.length - 1, low = 0;
int mid = (high + low) / 2;
while(low<=high)
{
if (x == t.head[mid])
return mid+1;
if (x > t.head[mid])
{
low = mid+1;
mid = (low + high) / 2;
}
else
{
high = mid-1;
mid = (low + high) / 2;
}
}
return -1;
}
void exchangeTable(table &t, int a)
{
int temp = t.head[a - 1];
t.head[a - 1] = t.head[a];
t.head[a] = temp;
}
void displayTable(table t)
{
for (int i = 0; i < t.length; i++)
{
printf("%d ", t.head[i]);
}
printf("\n");
}
int main()
{
table t;
int elem = 0;
t = InitTable();
for (int i = 0; i < t.size; i++)
{
t.head[i]=i+1;
t.length++;
}
cin >> elem;
displayTable(t);
int a=BrinarySearchTable(t, elem);
cout << a<<endl;
exchangeTable(t, a);
displayTable(t);
return 0;
}