#include<iostream>
using namespace std;
class CArray{
private :
int *p;
int size;
public:
CArray(int a) {size=a;p=new int[size];}
~CArray() {delete []p;}
int& GetElem(int i){ return p[i];}
void Input();
void Print();
void Sort();
int Search(int);
};
void CArray::Input(){
for(int i=0;i<size;i++){
cin>>p[i];
}
}
void CArray::Print(){
for(int i = 0;i<size;i++){
cout<<p[i]<<" ";
}
cout<<endl;
}
int CArray::Search(int a){
int count = 0,flag = 0;
for(int i = 0;i<size;i++){
if(a==p[i]){
count++;
flag=i;
}
}
if(count==1)
return flag;
else
return -1;
}
void CArray::Sort(){
for(int i = size-1 ; i>0 ; i--)
for(int j = 0 ; j <i ;j++){
if(p[j]>p[j+1]){
int temp = p[j+1];
p[j+1] = p[j];
p[j] = temp;
}
}
}
int main()
{
CArray a(5);
a.Input();
a.Print();
cout << a.GetElem(3) << endl;
cout << a.Search(6) << endl;
a.Sort();
a.Print();
return 0;
}
C++动态数组类
猜你喜欢
转载自blog.csdn.net/jd_457619512/article/details/71602300
今日推荐
周排行