C/C++/MFC
C기초 Linear Search (선형 탐색)
2008.03.13 09:48
#include "stdafx.h" #include<iostream> #include<iomanip> using namespace std; class CWATLinearSearch { private: int *x; int items; public: CWATLinearSearch(int); ~CWATLinearSearch(); void input(int []); int search(int); }; CWATLinearSearch::CWATLinearSearch(int n) { items=n; x=new int[items]; } CWATLinearSearch::~CWATLinearSearch() { delete [] x; } void CWATLinearSearch::input(int a[]) { for(int i=0;i<items;i++) x[i]=a[i]; } int CWATLinearSearch::search(int number) { for(int i=0;i<items;i++) { if(number==x[i]) return i+1; } return 0; } void main() { int a[100]={1,2,3,4,7,9,44,33,22,55,77,88,}; int n=12; int temp; cout<<"\n Enter search number :"; cin>>temp; CWATLinearSearch obj(n); obj.input(a); int position=obj.search(temp); if(position!=0) cout<<"\n Search number is present and its position:"<<position; else cout<<"\n search number is not present"; cout<<"\r\n"; }
결과
Enter search number :33
Search number is present and its position:8
Press any key to continue
Search number is present and its position:8
Press any key to continue
댓글 0
번호 | 제목 |
---|---|
공지 | 몇 가지 TIP 모음 |
공지 | Dialog 형태의 프로그램 만들기 [2] |
공지 | Visual C++ 에 유용한 링크 모음입니다. |
» | Linear Search (선형 탐색) |