1 #include <iostream>
 2 using namespace std;
 3 
 4 int max_value(int x, int max)
 5 {
 6     return max > x ? max : x;
 7 }
 8 
 9 int main()
10 {
11     const int x = 3, y = 4;
12     int a[x][y]={{34,62,34,101},{45,67,3,0},{11,45,97,100}};
13     int max = a[0][0], i, j, ix, iy;
14 
15     for(i = 0; i < x; i ++)
16     {
17         for(j = 0; j < y; j++)
18         {
19             max = max_value(a[i][j],max);
20             if(max == a[i][j])
21             {
22                 ix = i;
23                 iy = j;
24             }
25         }
26     }
27      cout << "a[" << ix << "][" << iy << "]=" << max << endl;
28 }

 1 #include <iostream>
 2 #include <iomanip>
 3 using namespace std;
 4 
 5 void select_sort(int a[],const int n)
 6 {
 7     int i, j, k;
 8     for(i = 0; i < n; i++)
 9     {
10         for(j = i + 1; j < n; j++)
11         {
12             if(a[i] > a[j])
13             {
14                 k = a[j];
15                 a[j] = a[i];
16                 a[i] = k;
17             }
18         }
19     }
20 }
21 
22 int main()
23 {
24     const int n = 10;
25     int a[n] = {2,45,67,13,8,5,1,200,50,23};
26     int i;
27 
28     select_sort(a, n);    
29     
30     for(i = 0; i < n; i++)
31     {
32         cout << setw(5) << a[i];
33     }
34     cout <<  endl;
35     return 0;
36 }