Skip to content
Sign upLog in
This post is read-only. Explore Repls and connect with other creators on Community.View Community
The info in this post might be out of date, check out our docs instead. View docs
3

FASTEST SORTING!!1!

pyelias
pyelias

IT SORTS SO FAST!!!
IT TAKES ONLY 250 SECONDS ON A LIST OF LENGTH 7!! (seriously, test it. it hasn't finished with 8 elements yet, started it 3hr ago)
THATS FAST!
https://repl.it/@pyelias/FASTEST-SORTING1
BTW I'm working on something better than this

5 years ago

Voters

Comments

TopNew
0
pyelias
pyelias

I'm working on finding the time complexity, I've lower bounded it at 2^n*n!
EDIT: It's O(n!^2 * e^n * sqrt(n))

5 years ago
0
Stratiz
Stratiz

Not entirely sure what's supposed to happen but when I type how long the list should be nothing happens.

5 years ago
0
pyelias
pyelias

@stratiz
: It takes a really long time if the list's longer than 6 elements.

5 years ago
Load more