static int counting_sortx( int** A[],  int** B[], int k, int rows, int col){
/*Array A[ ] stores the initial data to be sorted.
  Array B[ ] is used to store the final, sorted, list.
  Array C[ ] is used to count the occurrences of the data values
*/
int i,j,C[k], T[rows]; 
//The first for loop initialises C[] to zero.
	for (i=0; i<k; i++)
	   C[i] = 0;
//The second for loop increments the values in C[], according to their 
//frequencies in the data.
	for (j = 0; j < rows; j++)
	int x=[j][col];
	   C[x] = C[x] + 1;
//The third for loop adds all previous values, making C[] contain a cumulative 
//total.
	for (i = 1; i < k; i++)
	   C[i] = C[i] + C[i-1];
//The fourth for loop writes out the sorted data into array B[].
	for (j = 0; j < rows; j++){
	   B[C[A[j][col]]] = A[j][col];
	   C[A[j][col]] = C[A[j][col]] - 1;}
	return 0;
};     

//create an array 
int** ARR = new int*[data_rows];
int** A = new int*[data_rows];
int** B = new int*[data_rows];	
		for(i=0;i<data_rows;i++){
			ARR[i]=new int[data_columns];
			A[i]=new int[data_columns];
        	                                B[i]=new int[data_columns];	
        }
//then 
	while (j<data_columns) {
		for (i=0; i<data_rows; i++){	
			A[i][data_columns]=ARR[i][data_columns];
			}
		k=fRow[data_columns]+1;				//give k a value of max element in current column
		counting_sort::counting_sortx(ARR, B, k, data_rows, data_columns);
			};

for (int i=0; i<rows; i++)		
for (int j=0; j<col; j++){
	   B[C[A[i][col]]][col] = A[i][col];
	   C[A[i][col]] = C[A[i][col]] - 1;
}

//scol - column by which I sort, col - total number of colums
for (int j=0; j<rows; j++){
	   B[(C[A[j][scol]]-1)][scol] = A[j][scol];
	   C[A[j][scol]] = C[A[j][scol]] - 1;
       }