Sorting Diagonally Two Dimensional Array

[jaafarzzz]

First i created my two dimensional array, then i translated it to one dimensional array and i bubble sorted the 1D array, but after i didnt find the pattern to bring it back to 2D array dioganlly sorted.

#include<iostream>
#include<iomanip>

const int r = 10;
const int c = 10;
const int lim = r * c;
int A[r][c] = { 0 };
int B[lim];

using namespace std;

void generatearray(int A[][], int r, int c){
srand(time(NULL));
for (int i = 0; i < r; i++)
{
for (int j = 0; j < c; j++)
{
A[i][j] = rand() % lim;
}
}
}

void transformingto1Darray(int A[r][c], int b[lim]){
int p = 0;

for (int m = 0; m < r; m++){
for (int n = 0; n < c; n++){

B[p] = A[m][n];
p++;

}
}
}

void sorting1Darray(int B[][]){
int temp = 0;

for (int k = 0; k < lim - 1; k++){
for (int i = 0; i < lim - 1; i++)
if (B[i] > B[i + 1]){
temp = B[i];
B[i] = B[i + 1];
B[i + 1] = temp;
}
}
}

void sortingdiagonally2Darray(int A[][], int B[]){



int main{
generatearray(A);
transformingto1Darray(A, B);
sorting1Darray(B);
sortingdiagonally2Darray(A, B);


return 0;
}