C++课程实验7.doc

/*（）先读程序，写出程序的输出结果，再运行程序验证程序的输出。用友元重载方式重新编写程序*/#include using namespace std;class Vector public:Vector()Vector(int i,int j) x=i;y=j;friend Vector operator+=(Vector v1,Vector v2) v1.x+=v2.x;v1.y+=v2.y;return v1;friend Vector operator-=(Vector v, Vector u) /Vector temp;/temp.x=x-v.x;/temp.y=y-v.y;/return temp;v.x-=u.x;v.y-=u.y;return v;void display() cout(x,y)endl;private:int x,y;void main()Vector v1(1,2),v2(3,4),v3,v4;v3=v1+=v2;v4=v1-=v2;coutv1=;v1.display();coutv2=;v2.display();coutv3=;v3.display();coutv4=;v4.display();/*（）定义一个有理数类，重载比较运算符.写一个完整的程序，进行数据成员的设置和输出*/#includeusing namespace std;class rationalprivate:long denom,den;/denom为分子,den为分母public:rational(int num=0, int denom=1);int operator (rational r) const;int operator = (rational r) const;int operator = (rational r) const;int operator != (rational r) const;/这里增加赋值和读出函数void getdd()cout Enter the denom: denom;cout Enter the den den;void showdd()cout denom = denom endl;cout den = den den = num;this-denom = denom;int rational:operator (rational r) constdouble f1 = denom/den;double f2 = r.denom/r.den;return ( f1 f2 )? 1 : 0;int rational:operator = (rational r) constdouble f1 = denom/den;double f2 = r.denom/r.den;return ( f1 = f2 )? 1 : 0;int rational:operator = (rational r) constdouble f1 = denom/den;double f2 = r.denom/r.den;return ( f1 = f2 )? 1 : 0;int rational:operator != (rational r) constdouble f1 = denom/den;double f2 = r.denom/r.den;return ( f1 != f2 )? 1 : 0;void main()rational rat1;rat1.getdd();rat1.showdd();rational rat2(3,5);rat2.showdd();if ( rat1 rat2 )cout rat1 is less than rat2! endl;else if ( rat1 = rat2 )cout rat1 is less than or equal to rat2! endl;else if ( rat1 = rat2 )cout rat1 is equal to rat2! endl;else cout rat1 is not equal to rat2! endl;/*（）设计一个复数类，并重载，/ 和运算符。写完整程序并调试*/#includeusing namespace std;class complex /定义复数类private: /私有数据成员double real; /复数的实部double image; /复数的虚部public: /外部接口complex(double x=0,double y=0) /构造函数real=x;image=y;/分别声明实现四则运算函数的友元函数friend complex operator + ( complex& p1, complex& p2); /重载+运算符friend complex operator - ( complex& p1, complex& p2); /重载-运算符friend complex operator * ( complex& p1, complex& p2); /重载*运算符friend complex operator / ( complex& p1, complex& p2); /重载/运算符friend ostream& operator (ostream &os, complex &c); /重载运算符/*void show( complex& c)cout0)coutc.real+c.imageiendl;elsecoutc.realc.imageiendl;*/;/函数的实现complex operator + ( complex& p1, complex& p2)complex p;p.real = p1.real + p2.real;p.image = p1.image + p2.image;return p;complex operator - ( complex& p1, complex& p2)complex p;p.real = p1.real - p2.real;p.image = p1.image - p2.image;return p;complex operator * ( complex& p1, complex& p2)complex p;p.real = p1.real*p2.real - p1.image*p2.image;p.image = p1.real*p2.image + p1.image*p2.real;return p;complex operator / ( complex& p1, complex& p2)complex p;p.real = ( p1.real*p2.real + p1.image*p2.image ) / ( p2.real * p2.real + p2.image*p2.image);p.image = ( p1.image*p2.real-p1.real*p2.image ) / ( p2.real*p2.real+p2.image*p2.image);return p;ostream& operator0)os(c.real+c.imagei);elseos(c.realc.imagei); return os; void main()double real1,real2,image1,image2;cout输入第一个复数的实部和虚部：real1image1;cout输入第二个复数的实部和虚部：real2image2;coutThe resule is: endl;complex myp1(real1,image1),myp2(real2,image2),myp3,myp4;myp3 = myp1 + myp2; /加法cout myp1 + myp2 = myp3 endl; myp3 = myp1 - myp2; /减法cout myp1 - myp2 = myp3 endl; myp3 = myp1 * myp2; /乘法cout myp1 * myp2 = myp3 endl; myp3 = myp1 / myp2; /除法cout myp1 / myp2 = myp3 endl; /4）用类模板方式设计一个栈类stack，其中有两个私有数据成员：/s（存放栈元素）和top（栈顶元素下标），以及个公有成员函数：/push（元素入栈）、pop（元素出栈）和stackempty（判断栈是否为空），/并建立一个整数栈和一个字符栈。#includeusing namespace std;const int Max=20; template class stackprivate:T sMax;int top;public:stack();void push(T var);/进栈T pop();/出栈int stackempty();/判断是否为空;/-templatestack:stack()top = -1;/-templatevoid stack :push(T var)s+top = var;/-templateT stack:pop()return s top- ;/-templateint stack:stackempty()return (top = -1)? 0:1;int main()stack s1;s1.push(1);s1.push(2);s1.push(3);while(s1.stackempty()couts1.pop()endl;stack s2;s2.push(a);s2.push(b);s2.push(c);while(s2.stackempty()couts2.pop()endl;return 0;/（）用函数模板方式设计一个函数模板sort，采用直接插入排序方式对数据进行排序，/并对整数序列和字符序列进行排序。#includeusing namespace std;template void sort(T a, int n)int i,j,temp;for(i=1;in;i+)if(ai ai-1)temp = ai;j = i-1;while(tempaj)aj+1 = aj;j-;aj+1 = temp;int main()int n;int *a;char *b;cout请输