Given a matrix **mat[][]** of size **M*N**, the task is to sort only the border elements of the matrix in the clockwise direction and print the matrix after sorting again.

**Examples:**

Input:M = 4, N = 5, Below is the given matrix:1 2 3 4 0 1 1 1 1 2 1 2 2 2 4 1 9 3 1 7

Output:

0 1 1 1 1

9 1 1 1 1

7 2 2 2 2

4 4 3 3 2

Explanation:

For given matrix, border elements are:

(1, 2, 3, 4, 0, 2, 4, 7, 1, 3, 9, 1, 1, 1)

After sorting in clockwise order:

(0, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 7, 9)

Input:M = 3, N = 4

4 2 8 0 2 6 9 8 0 3 1 7

Output:

0 0 1 2

8 6 9 2

8 7 4 3

Explanation:

For given matrix, border elements are:

(4, 2, 8, 0, 8, 7, 1, 3, 0, 2)

After sorting in clockwise order:

(0, 0, 1, 2, 2, 3, 4, 7, 8, 8)

**Approach:** The idea is to store all border elements of the given matrix in an array and sort this array then simply print the new matrix using this sorted array as the border elements.

Detailed steps are as follows:

- Traverse the given matrix and push all the boundary elements to an array
**A[]**. - Sort array
**A[]**in ascending order. - Print first row using first
**N**elements of array**A[]**. - From second row to second-last row, first print a single element from end of
**A[]**, then print**N-2**middle elements from original matrix and finally a single element from the front of**A[]**. - For last row, print middle elements from
**A[]**which are still not printed, in reverse order.

Below is the implementation of the above approach:

`# Python program for the above approach ` ` ` `def` `printMatrix(grid, m, n): ` ` ` ` ` `A ` `=` `[] ` ` ` ` ` `# Appending border elements ` ` ` `for` `i ` `in` `range` `(m): ` ` ` `for` `j ` `in` `range` `(n): ` ` ` `if` `j ` `=` `=` `n` `-` `1` `or` `(i ` `=` `=` `m` `-` `1` ` ` `) ` `or` `j ` `=` `=` `0` `or` `i ` `=` `=` `0` `: ` ` ` `A.append(grid[i][j]) ` ` ` ` ` `# Sorting the list ` ` ` `A.sort() ` ` ` ` ` `# Printing first row with ` ` ` `# first N elements from A ` ` ` `print` `(` `*` `A[:n]) ` ` ` ` ` `# Printing N-2 rows ` ` ` `for` `i ` `in` `range` `(m` `-` `2` `): ` ` ` ` ` `# Print elements from last ` ` ` `print` `(A[` `len` `(A)` `-` `i` `-` `1` `], ` ` ` `end ` `=` `" "` `) ` ` ` `# Print middle elements ` ` ` `# from original matrix ` ` ` `for` `j ` `in` `range` `(` `1` `, n` `-` `1` `): ` ` ` `print` `(grid[i ` `+` `1` `][j], ` ` ` `end ` `=` `" "` `) ` ` ` ` ` `# Print elements from front ` ` ` `print` `(A[n ` `+` `i]) ` ` ` ` ` `# Printing last row ` ` ` `print` `(` `*` `reversed` `(A[n ` `+` `m` `-` `2` `:n ` `+` `m` `-` `2` `+` `n])) ` ` ` `# Driver Code ` ` ` `# Dimensions of a Matrix ` `m, n ` `=` `4` `, ` `5` ` ` `# Given Matrix ` `grid ` `=` `[[` `1` `, ` `2` `, ` `3` `, ` `4` `, ` `0` `], ` ` ` `[` `1` `, ` `1` `, ` `1` `, ` `1` `, ` `2` `], ` ` ` `[` `1` `, ` `2` `, ` `2` `, ` `2` `, ` `4` `], ` ` ` `[` `1` `, ` `9` `, ` `3` `, ` `1` `, ` `7` `]] ` ` ` `# Function Call ` `printMatrix(grid, m, n) ` |

*chevron_right*

*filter_none*

**Output:**

0 1 1 1 1 9 1 1 1 1 7 2 2 2 2 4 4 3 3 2

**Time Complexity:** O(M*N)

**Auxiliary Space:** O(M+N)

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the **DSA Self Paced Course** at a student-friendly price and become industry ready.

## Recommended Posts:

- Boundary elements of a Matrix
- Minimum steps to reach any of the boundary edges of a matrix | Set-2
- Minimum steps to reach any of the boundary edges of a matrix | Set 1
- Find sum of all Boundary and Diagonal element of a Matrix
- Check if a matrix contains a square submatrix with 0 as boundary element
- Know Your Sorting Algorithm | Set 1 (Sorting Weapons used by Programming Languages)
- Know Your Sorting Algorithm | Set 2 (Introsort- C++’s Sorting Weapon)
- Sorting objects using In-Place sorting algorithm
- Swap Alternate Boundary Pairs
- Sorting rows of matrix in ascending order followed by columns in descending order
- Sorting rows of matrix in descending order followed by columns in ascending order
- Sorting Array Elements By Frequency | Set 3 (Using STL)
- Sorting all array elements except one
- Sorting array except elements in a subarray
- Sorting without comparison of elements
- Sorting array elements with set bits equal to K
- Find the Minimum length Unsorted Subarray, sorting which makes the complete array sorted
- Stability in sorting algorithms
- Which sorting algorithm makes minimum number of memory writes?
- Lower bound for comparison based sorting algorithms

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.