#Double-Sort Algorithm

13 messages · Page 1 of 1 (latest)

obtuse ember
#

It's important to note that I've only tested it on Linux. It's got some simple tests you can run too.

lament zenith
#

I can do a full code review later today if you want

obtuse ember
#

Hey, thank you for helping me. If you feel like it and don't have anything else to do it'll be lovely! ferrisRelieved

obtuse ember
#

I've also tested it on Windows and it runs at the same performance on average

#

Double-Sort Algorithm

obtuse ember
#

It now has a new function which uses the same concept to sort numbers but does so without BinaryHeaps

obtuse ember
#

To test it use the following commands:

#
git clone https://github.com/Shroomerian/sorting-visualization

cd sorting-visualization

cargo build --release

cargo run --release double_sort
#

There's two branches of it. The main branch uses double_heap_sort which allows it to crunch 10000 numbers in less than a minute, and the other use double_sort, which does not use BinaryHeaps to figure out the references so it's slower and can't really handle 10000 numbers