6-1 运算符重载(c++)

在这里插入代码片
```在这里描述函数接口：
i#include 
using namespace std;

class Complex {
    double real;
    double imag;
public:
    //构造函数
    Complex(double real=0, double imag=0);

    //operator+-*/=操作符函数
    Complex operator+(const Complex& c) const;
    Complex operator-(const Complex& c) const;
    Complex operator*(const Complex& c) const;
    Complex operator/(const Complex& c) const;
    Complex operator=(const Complex& c);

    //operator <=操作符函数
    bool operator<=(const Complex& c) const;

    //友元函数声明以帮助operator<<()函数访问Complex类的私有成员
    friend ostream& operator<<(ostream& out, const Complex& c);
};

//n个复数，按模从小到达排序
void bubble_sort(Complex[],int n);

在这里给出函数被调用进行测试的例子：
int main() {
    double dReal1, dImag1, dReal2, dImag2;

    int mode;
    cin>>mode;
    cin>>dReal1>>dImag1>>dReal2>>dImag2;
    Complex c1(dReal1, dImag1);
    Complex c2(dReal2, dImag2);
    Complex c[6] = {c1,c2,c1+c2,c1-c2,c1*c2,c1/c2};
    switch(mode)
    {
        case 1: cout << c[0]<<" "<
    this->real = real;
    this->imag = imag;
}
Complex Complex::operator+(const Complex & c) const
{
    return Complex(real + c.real, imag + c.imag);
}
Complex Complex::operator-(const Complex& c) const
{
    return Complex(real - c.real, imag - c.imag);
}
Complex Complex::operator*(const Complex& c) const
{
    return Complex(real*c.real-imag*c.imag,real*c.imag+imag*c.real);
}
Complex Complex::operator/(const Complex& c)const
{
    return Complex((real*c.real+imag*c.imag)/(c.real*c.real+c.imag*c.imag),(imag*c.real-real*c.imag)/(c.real*c.real+c.imag*c.imag));
}
Complex Complex::operator=(const Complex& c)
{
    return Complex(this->real = c.real, this->imag = c.imag);
}
bool Complex::operator<=(const Complex& c) const
{
    if (real*real+imag*imag<=c.real*c.real+c.imag*c.imag)
    {
        return 1;
    }
    else
    {
        return 0;
    }
} 

ostream& operator<<(ostream& out, const Complex& c)
{
    out << c.real;
    if (c.imag >=0)
    {
        out << "+";
    }
    out << c.imag<<"i";
    return out;
}
void bubble_sort(Complex fushu[], int n)
{
    Complex cnt;
    for (int i = 0; i < n - 1; ++i) //比较n-1轮
    {
        for (int j = 0; j < n - 1 - i; ++j) //每轮比较n-1-i次,
        {
            if (fushu[j+1]<=fushu[j])
            {
                cnt = fushu[j];
                fushu[j] = fushu[j + 1];
                fushu[j + 1] = cnt;
            }
        }
    }
}

![在这里插入图片描述](https://img-blog.csdnimg.cn/7f1d46ac23fa41df852a610ec07a1185.png)