Skip to content

Algorithms: Deductive Sort

Jump to bottom
Maxim Buzdalov edited this page Dec 30, 2018 · 2 revisions 
@article{ deductive-and-climbing-sort,
    author      = {Kent McClymont and Ed Keedwell},
    title       = {Deductive Sort and Climbing Sort:
                   New Methods for Non-Dominated Sorting}
    journal     = {Evolutionary Computation},
    year        = {2012},
    volume      = {20},
    number      = {1},
    pages       = {1-26},
    publisher   = {MIT Press},
    langid      = {english}
}

How to get an instance:

  • DeductiveSort.getInstance() -- returns an instance of the Deductive Sort algorithm. The worst-case running time complexity (contrary to what claimed in the paper) is O(MN^3), the required memory is O(N). It often works 2-3 times faster than Fast Non-Dominated Sorting.

Clone this wiki locally