Open In App

Javascript Program for Sort the given matrix

Improve
Improve
Like Article
Like
Save
Share
Report

Given a n x n matrix. The problem is to sort the given matrix in strict order. Here strict order means that matrix is sorted in a way such that all elements in a row are sorted in increasing order and for row ‘i’, where 1 <= i <= n-1, first element of row 'i' is greater than or equal to the last element of row 'i-1'.
Examples: 
 

Input : mat[][] = { {5, 4, 7},
                    {1, 3, 8},
                    {2, 9, 6} }
Output : 1 2 3
         4 5 6
         7 8 9

 

Approach: Create a temp[] array of size n^2. Starting with the first row one by one copy the elements of the given matrix into temp[]. Sort temp[]. Now one by one copy the elements of temp[] back to the given matrix.
 

Javascript




<script>
  
// JavaScript implementation to sort
// the given matrix
  
let SIZE  = 10
  
// function to sort the given matrix
function sortMat(mat, n)
{
    // temporary matrix of size n^2
    let temp = new Array(n * n);
    let k = 0;
  
    // copy the elements of matrix one by one
    // into temp[]
    for (let i = 0; i < n; i++)
        for (let j = 0; j < n; j++)
            temp[k++] = mat[i][j];
  
    // sort temp[]
    temp.sort();
      
    // copy the elements of temp[] one by one
    // in mat[][]
    k = 0;
    for (let i = 0; i < n; i++)
        for (let j = 0; j < n; j++)
            mat[i][j] = temp[k++];
}
  
// function to print the given matrix
function printMat(mat, n)
{
    for (let i = 0; i < n; i++) {
        for (let j = 0; j < n; j++)
            document.write( mat[i][j] + " ");
        document.write( "<br>");
    }
}
  
// Driver program to test above
  
    let mat = [ [ 5, 4, 7 ],
                 [ 1, 3, 8 ],
                [ 2, 9, 6 ] ];
    let n = 3;
  
    document.write( "Original Matrix: " + "<br>");
    printMat(mat, n);
  
    sortMat(mat, n);
    document.write( "<br>");
    document.write( "
Matrix After Sorting: " + "<br>");
    printMat(mat, n);
  
// This code is contributed by Manoj
  
</script>


Output:  

Original Matrix:
5 4 7
1 3 8
2 9 6

Matrix After Sorting:
1 2 3
4 5 6
7 8 9

Time Complexity: O(n2log2n). 
Auxiliary Space: O(n2).
 

Please refer complete article on Sort the given matrix for more details!



Last Updated : 18 Jan, 2022
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads