1、线性搜索
题目:
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_4_A
代码:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int sum;
bool search(int A[],int n,int key)
{
int i=0;
A[n]=key;
while(A[i]!=key)i++;
return i!=n;
}
int main()
{
//线性搜索
int n,A[10001],q,B[505];
cin>>n;
for(int i=0;i<n;i++){
cin>>A[i];
}
cin>>q;
for(int i=0;i<q;i++){
cin>>B[i];
if(search(A,n,B[i])) sum++;
}
cout<<sum<<endl;
return 0;
}
2、二分搜索
题目:
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_4_B
代码:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int A[100001],n;
//二分搜索
int binarysearch(int key)
{
int left=0,right=n;
int mid;
while(left<right){
mid=(left+right)/2;
if(A[mid]==key) return 1;
else if(key<A[mid]) right=mid;
else if(key>A[mid]) left=mid+1;
}
return 0;
}
int main()
{
int i,q,k,sum=0;
cin>>n;
for(i=0;i<n;i++){
cin>>A[i];
}
cin>>q;
int B[q];
for(i=0;i<q;i++){
cin>>k;
if(binarysearch(k))sum++;
}
cout<<sum<<endl;
return 0;
}
3、散列搜索