# Fast optimized non dominated sorting algorithms

**URL:** <https://discourse.julialang.org/t/fast-optimized-non-dominated-sorting-algorithms/86793>\
**Category:** General Usage\
**Tags:** sorting\
**Created:** [September 5, 2022, 10:01am UTC](https://discourse.julialang.org/t/fast-optimized-non-dominated-sorting-algorithms/86793 "2022-09-05T10:01:51Z")\
**Posts on this page:** 1\
**Showing post:** 7

<div class="post-metadata">

**Author:** ![digital\_carver](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/digital_carver/32/33818_2.png) [@digital\_carver](https://discourse.julialang.org/u/digital_carver)\
**Post date:** [September 5, 2022, 1:43pm UTC](https://discourse.julialang.org/t/fast-optimized-non-dominated-sorting-algorithms/86793/7 "2022-09-05T13:43:03Z")

</div>

Thanks a lot for the info and for doing the comparisons.

With the Java implementation, which one of the implementations did you use for these measurements? `getRedBlackTreeSweepImplementation` ?

By the way, it looks like [the Python implementation](https://github.com/KernelA/nds-py/blob/master/nds/ndomsort.py) is relatively simpler in terms of code, implementing only the Buzdalov2014 paper rather a combination of three papers as the Java version does. So, for anyone interested in implementing this, the Python version would probably make for a good starting point.

---

_[View the full topic](https://discourse.julialang.org/t/fast-optimized-non-dominated-sorting-algorithms/86793)._