Python Program to Sort the given matrix

# Python3 implementation to sort
# the given matrix

SIZE = 10

# Function to sort the given matrix
def sortMat(mat, n) :
    
    # Temporary matrix of size n^2
    temp = [0] * (n * n)
    k = 0

    # Copy the elements of matrix  
    # one by one into temp[]
    for i in range(0, n) :
        
        for j in range(0, n) :
            
            temp[k] = mat[i][j]
            k += 1

    # sort temp[]
    temp.sort()
    
    # copy the elements of temp[] 
    # one by one in mat[][]
    k = 0
    
    for i in range(0, n) :
        
        for j in range(0, n) :
            mat[i][j] = temp[k]
            k += 1


# Function to print the given matrix
def printMat(mat, n) :
    
    for i in range(0, n) :
        
        for j in range( 0, n ) :
            
            print(mat[i][j] , end = " ")
            
        print(" ")
    
    
# Driver program to test above
mat = [ [ 5, 4, 7 ],
        [ 1, 3, 8 ],
        [ 2, 9, 6 ] ]
n = 3

print( "Original Matrix:")
printMat(mat, n)

sortMat(mat, n)

print("Matrix After Sorting:")
printMat(mat, n)


# This code is contributed by Nikita Tiwari.

import numpy as np

mat = [[5, 4, 7],
       [1, 3, 8],
       [2, 9, 6]]

# flatten the matrix into a single list
flat_list = [item for sublist in mat for item in sublist]

# sort the list
flat_list.sort()

# reshape the list into the original matrix shape
mat = np.array(flat_list).reshape((3, 3))

# print the sorted matrix
for row in mat:
    print(row)

import heapq

def sort_matrix(mat):
    # Step 1: Create a min-heap and insert all elements of the matrix into it.
    heap = []
    for row in mat:
        for num in row:
            heapq.heappush(heap, num)

    # Step 2: Extract the minimum element from the heap repeatedly to create a sorted list.
    sorted_list = []
    while heap:
        sorted_list.append(heapq.heappop(heap))

    # Step 3: Reshape the sorted list back into a matrix.
    n_rows = len(mat)
    n_cols = len(mat[0])
    sorted_mat = [sorted_list[i:i+n_cols] for i in range(0, len(sorted_list), n_cols)]

    return sorted_mat

# Example usage:
mat = [[5, 4, 7], [1, 3, 8], [2, 9, 6]]
sorted_mat = sort_matrix(mat)
for row in sorted_mat:
    print(row)