Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //bài 6:
- #include <iostream>
- using namespace std;
- int SequentialSearch(int x, int a[],int n)//tim kiem tuan tu
- {
- int i =0;
- while ((i<n) && (a[i]!=x))
- {
- i++;
- if(a[i]==x)
- return i;
- }
- return 0;
- }
- void Nhap(int a[],int n)
- {
- for(int i=0;i<n;i++)
- {
- cout<<"a["<<i+1<<"]= ";
- cin>>a[i];
- }
- }
- void Xuat(int a[],int n)
- {
- cout<<"Xem mang: ";
- for(int i=0;i<n;i++)
- cout<<endl<<a[i];
- }
- int main ()
- {
- int a[100], x,n;
- cout<<"Nhap n: ";
- cin>>n;
- Nhap(a,n);
- Xuat (a,n);
- cout<<endl<<"Nhap x can kiem tra: ";
- cin>>x;
- int m= SequentialSearch(x,a,n);
- if (m==0) cout<<"khong tim thay";
- else cout<<"tim thay";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement