Insertion Sort in 2D

An n×n two-dimensional array has to be sorted using an insertion sort algorithm in a unique way. The aim is when starting from element at position [0][0] and traversing all the outermost elements in an anticlockwise direction and finally returning back to [0][0], then elements should appear in a non-decreasing order. Similarly, when starting from element at position [1][1] and traversing all the e