第二次C++作业（函数重载与函数模板，以及简单类的定义与实现）

 1 #include<iostream>
 2 using namespace std;
 3 struct Complex 
 4         {
 5             double real;
 6             double imaginary;
 7         };
 8 
 9 int add(int, int);
10 double add(double,double);
11 Complex add(Complex, Complex);
12 int main() {
13     int x, y;
14     cout << "Please input two numbers:";
15     cin >> x >> y;
16     cout << "The sum is:" << add(x, y) << endl;
17     double m, n;
18     cout << "Please input two double numbers:";
19     cin >> m >> n;
20      cout << "The sum is:" << add(m, n) << endl;
21         struct Complex e,f;
22         cout << "Please input the first r and i numbers:";
23         cin >> e.real >> e.imaginary;
24       cout << "Please input the second r and i numbers:";
25          cin >> f.real >> f.imaginary;
26     cout<<"The sum is:";
27     add(e,f);
28 
29 
30         return 0;
31 }
32 int add(int a,int b)
33 {
34     return a + b;
35 }
36 double add(double a,double b)
37 {
38     return a + b;
39 }
40 Complex add(Complex e,Complex f)
41 {
42     cout<<e.real+f.real<<"+"<<e.imaginary+f.imaginary<<"i";
43 
44 }

 1 #include<iostream>
 2 using namespace std;
 3 template<class T>
 4 void myswap(T &x,T &y)
 5 {
 6  T temp=x;
 7  x = y;
 8  y = temp;
 9 }
10 template<class T>
11 void quicksort(T a[],int n)
12 {
13  while(true)
14  {
15  int i = 0, j = n - 1;
16  T key = a[0];
17  for (i = 1; i < n;i++)
18  {
19  if(a[i]<key)
20  {
21  i = 0;
22  break;
23  }
24  else
25  key = a[i + 1];
26  }
27  for (j = n - 1; j>i; j--)
28  {
29  if(a[j]<key)
30  {
31  myswap(a[i], a[j]);
32  break;
33  }
34  }
35  for (i = 0; i<j; i++)
36  if (a[i]>key)
37  {
38  myswap(a[i], a[j]);
39  break;
40  }
41  quicksort(a, n);
42  if (i == j)
43  break;
44  }
45 }
46 template<class T>
47 void output(T q[],int k)
48 {
49  for (int i = 0; i < k;i++)
50  {
51  cout << q[i]<<" ";
52  }
53  cout << endl;
54 }
55 int main()
56 {
57  int m[7] = {6, 3, 7, 4, 2, 1,9};
58  quicksort(m, 7);
59  output(m, 7);
60  return 0;
61 }