1-2.cpp

二、通过将其元素插入到双向链表中的方法对数组A进行排序。算法对链表的当前操作位置进行维护

#include <iostream>
using namespace std;

class Complex
{
private:
	double real;
	double imag;
public:
	Complex() {
		real=0;
		imag=0;
	}
	Complex(double r,double i) {
		real=r;
		imag=i;
	}
	Complex operator + (Complex &c) {
		return Complex(real+c.real,imag+c.imag);
	}
	Complex operator - (Complex &c)	{
		return Complex(real-c.real,imag-c.imag); 
	}
	Complex operator * (Complex &c)	{
		return Complex(real*c.real,imag*c.imag);
	}
	Complex operator / (Complex &c)	{
		return Complex(real/c.real,imag/c.imag);
	}
	void display();
};
void Complex::display() {
	cout <<"("<<real;
	if (imag>0)
		cout<<"+";
	cout <<imag<<"i)"<<endl;
}
int main(int argc, char* argv[]) {
	Complex a(1,2),b(2,-3),c;
	
	cout <<"Complex a : ";
	a.display();
	cout <<"Complex b : ";
	b.display();
	c=a+b;
	cout <<"a+b = ";
	c.display();
	c=a-b;
	cout <<"a-b = ";
	c.display();
	c=a*b;
	cout <<"a*b = ";
	c.display();
	c=a/b;
	cout <<"a/b = ";
	c.display();
	return 0;
}