An Efficient Selection Sorting Algorithm for Two-Dimensional Arrays

Borrowing ideas from one-dimensional array selection sorting algorithms, we propose a sorting algorithm for two-dimensional arrays. Both theoretical analysis and experimental evaluation show that the proposed algorithm is easy to implement, and has much lower computational complexity than one-dimensional sorting algorithms, especially when arrays have large size. Furthermore, we convert the sorting of one-dimensional arrays to that of two-dimensional (m×n) arrays, and find the values of m and n that minimize the computation time.