scau：数据结构oj 实验五

//8610 顺序查找

int Search_Seq(SSTable& ST, ElemType key)
{
	for(int i=1;i<=ST.length;i++)
	{
	    if(ST.elem[i]==key)
	    return i;
	}
	return 0;
}

//8621 二分查找
#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
    int n;
    cin>>n;
    int a[n];
    for(int i=0;i<n;i++)
    cin>>a[i];
    int key;
    cin>>key;
    int low=0,high=n-1;
    int mid;
    while(low<=high)
    {
        mid=(low+high)/2;
        if(key>a[mid])
        low=mid+1;
        else if(key<a[mid])
        high=mid-1;
        else
        {
            cout<<"The element position is "<<mid<<"."<<endl;
            return 0;
        }
    }
    cout<<"The element is not exist."<<endl;
    return 0;
}

//8622 哈希查找
unsigned Hash(ElemType K)
{

    int p;//要定义了p之后再返回
    p=(3*K)%length;//注意是大写K
    return p;
}


void collision(int *p)
{
    *p=(*p+1)%length;

}


void TraverseHash(HashTable H)
 {
   int i;
   //printf("HashTable Address:0～%d\n",length-1);
   for(i=0;i<length;i++)
     if(H.elem[i]==NULLKEY)
       printf("X ");
	 else
		 printf("%d ",H.elem[i]);
	 printf("\n");
}