C language puts the largest element in a 5X5 matrix in the center and the four smallest elements in the four corners respectively.

Here, it is assumed that the second smallest is the second element (subscript 0, 1), because the 1 element (subscript 0,0) has been placed near the minimum value in the whole array through the previous process, so we should find the second smallest, the third smallest and the fourth smallest from the second element. If there is no such sentence, the second and fourth smallest will be found later.