IntArray类

Implement the class IntArray according to the following class declaration.

class IntArray {
public:
// constructors
IntArray( int *array, int array_size );
IntArray( const IntArray &rhs );
// destructor
~IntArray() { delete [] ia; }
//member functions
bool operator == ( const IntArray& ) const;
bool operator != ( const IntArray& ) const;
IntArray& operator = ( const IntArray& );
int size () const;
void sort ();
int min () const;
int max () const;
int find ( int value ) const;
IntArray& copy (IntArray& rhs)
private:
int _size;
int* ia;
};

==================================================================================

#include<iostream>
using namespace std;
class IntArray {
public:
IntArray( int *array, int array_size );
IntArray( const IntArray &rhs );
~IntArray() { delete [] ia; }
bool operator == ( const IntArray& ) const;
bool operator != ( const IntArray& ) const;
IntArray& operator = ( const IntArray& );
int size () const;
void sort ();
int min () const;
int max () const;
int find ( int value ) const;
IntArray& copy (IntArray& rhs);
void show();
private:
int _size;
int* ia;
};
IntArray::IntArray(int *array,int array_size)
{
    ia=new int[array_size];
    for(int i=0;i<array_size;i++)ia[i]=array[i];
    _size=array_size;
}
IntArray::IntArray(const IntArray &rhs)   
{
    ia=new int[rhs._size];
    for(int i=0;i<rhs._size;i++)ia[i]=rhs.ia[i];
    _size=rhs._size;
}
bool IntArray::operator==(const IntArray& rhs) const
{
    int i=0;
    if(_size!=rhs._size)return false;
    while(ia[i]==rhs.ia[i])
    {
        i++;
        if(i==_size)return true;
    }
    return false;
}       
bool IntArray::operator != ( const IntArray& rhs) const
{
    int i=0;
    if(_size!=rhs._size)return true;
    while(ia[i]==rhs.ia[i])
    {
        i++;
        if(i==_size)return false;
    }
    return true;
}
IntArray& IntArray::operator = ( const IntArray& rhs)  
{
    delete []ia;
    ia=new int[rhs._size];
    for(int i=0;i<rhs._size;i++)ia[i]=rhs.ia[i];
    _size=rhs._size;
}
int IntArray::size () const  
{
    return _size;
}
void IntArray::sort()  
{
    int temp;
    for(int i=0;i<_size-1;i++)
        for(int j=i+1;j<_size;j++)
            if(ia[i]>ia[j])temp=ia[i],ia[i]=ia[j],ia[j]=temp;
}
int IntArray::min() const
{
    int temp=ia[0];
    for(int i=1;i<_size;i++)
        if(temp>ia[i])temp=ia[i];
        return temp;
}  
int IntArray::max() const
{
    int temp=ia[0];
    for(int i=1;i<_size;i++)
        if(temp<ia[i])temp=ia[i];
        return temp;
}
int IntArray::find ( int value ) const   
{
    for(int i=0;i<_size;i++)
        if(ia[i]==value)return i;
    return -1;
}
IntArray& IntArray::copy (IntArray& rhs)  
{
    delete []ia;
    ia=new int[rhs._size];
    for(int i=0;i<rhs._size;i++)ia[i]=rhs.ia[i];
    _size=rhs._size;
}
void IntArray::show()
{
    for(int i=0;i<_size;i++)cout<<ia[i]<<"  ";
    cout<<endl;
}   
int main(int argc,char* argv[])  
{
    int a[10]={10,9,1,8,2,3,4,6,5,7},b[6]={-6,-5,-1,-2,-3,-4};
    int temp=3,temp1=100;

    IntArray Int1(a,10);         //构造一
    Int1.show();                 //显示测试
    IntArray Int2(Int1);         //构造二
    Int2.show();                 //显示测试

    cout<<"此时数组大小为"<<Int1.size()<<endl;   //测试size()

    cout<<"最小值为:"<<Int1.min()<<endl;
    cout<<"最大值为:"<<Int1.max()<<endl;   //测试max() min()

    if(Int1==Int2)cout<<"此时两者相等"<<endl;
    else cout<<"此时两者不等"<<endl;             //测试==

    Int1.sort();                  //排序
    Int1.show();                 //显示测试

    if(Int1!=Int2)cout<<"此时两者不等"<<endl;
    else cout<<"此时两者相等"<<endl;             //测试!=
   
    cout<<"此时Int2为:/n";
    Int2.show();
    Int2=Int1;
    cout<<"被赋值后:/n";
    Int2.show();

    IntArray Int3(b,6);
    Int3.show();
    Int2.copy(Int3);         //测试copy
    Int2.show();
   
    Int1.show();
    cout<<Int1.find(temp)<<endl;    
    cout<<Int1.find(temp1)<<endl;//测试find()
   
    system("PAUSE");
    return 0;
}