#include<iostream>
#include<cstdlib>
#include <cstdlib>
#include <ctime>
#include <algorithm>

using namespace std;

/**Create a main.cpp
 that will generate an A(n,n)
  tensor with random values between [-1000,1000].
   Then assign to n workers (processes) a sorting process
    (prolific or collective) to sort each tensor line values back to 
    tensor A, and print out the tensor A again*/ 

int main() {
  int n; 
  cout<<"What is the size of the nxn array?"<<endl;
  cin>>n;

double A[n][n];

  srand(time(0));
//dilosi timon  
   for (int i = 0; i < n; i++) {
     for (int j = 0; j < n; j++) {
       A[i][j] = rand() % 2001 - 1000;
                               }
                                  }
//ektiposi pinaka

     for (int i = 0; i < n; i++) {
      for (int j = 0; j < n; j++) {
     cout<<   A[i][j] <<" ";
                                 }
        cout<<endl;
                                   }
//taxinomisi pinaka(tis i grammis tou pinaka)
for (int i=0; i <n ;i++) {
sort(A[0], A[n]);
                          }
//ektiposi taxinomimenou pinaka 
cout<<endl;
cout <<"Sorted Array"<<endl;
     for (int i = 0; i < n; i++) {
      for (int j = 0; j < n; j++) {
     cout<<   A[i][j] <<" ";
                                 }
        cout<<endl;
                                   }
                               
      return 0;     }