顺序查找和折半查找

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<time.h>

typedef int ElemType;
typedef struct {
	ElemType* elem;//整型指针
	int TableLen;//存储动态数组里边的元素的个数
}SSTable;

void ST_Init(SSTable& ST, int len) 
{
	ST.TableLen = len + 1;//设置数组的长度为1，多申请了一个位置，为了存放哨兵
	ST.elem = (ElemType*)malloc(sizeof(ElemType) * ST.TableLen);//malloc指向一个大小为sizeof(ElemType)*ST.TableLen;
	srand(time(NULL));//随机数生成srand(time(NULL))
	for (int i = 0; i < ST.TableLen; i++)
	{
		ST.elem[i] = rand() % 100;//让ST中的elem指向的数组空间初始化
	}
}

int Search_Seq(SSTable& ST, ElemType key) 
{
	ST.elem[0] = key;//让零号元素作为哨兵，用于元素是否找到没有
	int i;
	for ( i = ST.TableLen - 1; ST.elem[i] != key; --i);
	return i;
}


void ST_print(SSTable ST) 
{
	for (int i = 0; i < ST.TableLen; i++)
	{
		printf("%-3d",ST.elem[i]);
	}
}

int compare(const void* left, const void* right)//left,right值任意来个元素的地址值 
{
	return *(ElemType*)left - *(ElemType*)right;//从小到大排序规则
}

//二分查找
int Binary_Search(SSTable L,ElemType key)
{
	int low = 0, high = L.TableLen - 1, mid;
	while (low<=high)
	{
		mid = (low + high) / 2;
		if (L.elem[mid]==key)
		{
			return mid;
		}
		else if (L.elem[mid] > key) 
		{
			high = mid - 1;
		}
		else
		{
			low = mid + 1;
		}
	}
	return -1;
}

int main() 
{
	SSTable ST;
	ElemType key;
	int pos;//存储查询元素的位置
	ST_Init(ST,10);
	ST_print(ST);
	printf("\n请输入要搜索的key的值:\n");
	scanf("%d",&key);
	pos = Search_Seq(ST, key);
	if (pos)
	{
		printf("查找成功 位置为%d\n",pos);
	}
	else
	{
		printf("查找失败\n");
	}
	qsort(ST.elem, ST.TableLen, sizeof(int), compare);//qsort实现快排序
	ST_print(ST);
	printf("\n二分查找，请输入要搜索的key的值\n");
	scanf("%d",&key);
	//二分查找的前提必须是有序的
	pos = Binary_Search(ST,key);
	if (pos)
	{
		printf("查找成功 位置为 %d\n",pos);
	}
	else
	{
		printf("查找失败\n");
	}
	return 0;
}