Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- #include <iomanip>
- using namespace std;
- ifstream in ("input.txt");
- ofstream out ("output.txt");
- void kek (int *a, int n)
- {
- int temp;
- int lowindex, lowkey, i, j;
- for( i=0; i<n-1; i++)
- {
- lowindex = i;
- lowkey = a[i];
- for (j=i+1; j<n; j++) if (a[j]>lowkey) {lowkey=a[j]; lowindex=j;}
- temp=a[i];
- a[i]=a[lowindex];
- a[lowindex]=temp;
- }
- for (int i=0; i<n; i++)
- cout << a[i] << " ";
- cout<< endl;
- }
- int main()
- {
- int aray[10][10];
- int n;
- in >> n;
- for (int i=0; i<n; i++)
- for (int j=0; j<n; j++)
- in >> aray[i][j];
- int b[10];
- for (int i = n - 2; i >= 0; i--)
- {
- for (int j = 0; j<n - i; j++)
- {
- b[j] = aray[j][i + j];
- }
- kek(b, n - i);
- for (int j = 0; j<n - i; j++)
- {
- aray[j][i + j] = b[j];
- //cout << b[j] << " ";
- }
- }
- int b2[10];
- for (int i = 1; i<n - 1; i++)
- {
- int k=0;
- for (int j = i; j <= n - 1; j++)
- {
- b2[k] = aray[j][j - i];
- // cout << b2[j];
- cout<< b2[k] << "_";
- k++;
- }
- kek(b2,n-i );
- k=0;
- for (int j = i; j <= n - 1; j++)
- {
- cout << "Sort "<<b2[k] << endl;
- aray[j][j - i] = b2[k];
- k++;
- }
- }
- for (int i=0; i<n; i++)
- {
- for (int j=0; j<n; j++)
- out<<" "<<aray[i][j];
- out<<'\n';
- }
- in.close();
- out.close();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement