Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- void SortPeven(int *a, int n)
- {
- int i, j;
- for (i = 0; i < n - 1; i++)
- for (j = n - 1; j > i; j--)
- if (a[j] < a[j - 1])
- {
- swap(a[j], a[j - 1]);
- j--;
- }
- }
- void SortPuneven(int *a, int n)
- {
- int i, j;
- for (i = 0; i < n - 1; i++)
- for (j = n - 1; j > i; j--)
- if (a[j] > a[j - 1])
- {
- swap(a[j], a[j - 1]);
- j--;
- }
- }
- void print(int **a, int n)
- {
- for (int i = 0; i<n; ++i, cout << endl)
- for (int j = 0; j<n; ++j)
- cout << a[i][j] << "\t";
- }
- int main()
- {
- setlocale(0,"");
- int n, i, j;
- cout << "Введите размерность матрицы NxN : ";
- cin >> n;
- int**a=new int*[n];
- for (i=0; i < n; i++)
- {
- a[i]=new int[n];
- for (j=0; j<n; j++)
- {
- cout << "a[" << i << "][" << j << "]= ";
- cin >> a[i][j];
- }
- }
- print(a,n);
- int*x=new int[n];
- cout << endl;
- for (j=0; j < n; j+=2)
- {
- int k, l;
- for (k=0, l=j, i=0; k<n; k++, i++)
- x[i]=a[k][l];
- SortPeven (x, n);
- for (k=0, l=j, i=0; k<n; k++, i++)
- a[k][l]=x[i];
- }
- cout << endl;
- for (j=1; j<n; j+=2)
- {
- int k, l;
- for (k=0, l=j, i=0; k<n; k++, i++)
- x[i]=a[k][l];
- SortPuneven (x, n);
- for (k=0, l=j, i=0; k<n; k++, i++)
- a[k][l]=x[i];
- }
- cout << endl;
- for ( i=0; i<n; i++, cout << endl)
- for (j=0; j<n; j++)
- cout << a[i][j]<< " ";
- for (i=0; i<n; i++)
- delete[]a[i];
- delete[]a;
- delete[]x;
- system ("pause");
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement