Algorithms: Corner Sort

@article{ corner-sort,
    author      = {Handing Wang and Xin Yao},
    title       = {Corner Sort for Pareto-Based Many-Objective Optimization},
    journal     = {IEEE Transactions on Cybernetics},
    year        = {2013},
    volume      = {44},
    number      = {1},
    pages       = {92-102},
    publisher   = {IEEE},
    langid      = {english}
}

How to get an instance:

• CornerSort.getInstance() -- returns an instance of the Corner Sort algorithm. The worst-case running time complexity is O(MN^2), the required memory is O(N). This algorithm seems to be among the best algorithms published before 2015 when working with M around 10 or higher.