What's the best sorting algorithm?
>>54410476
Bogo sort. O(1) best case
>>54410503
O(n) to shuffle, O(n) to check if correct, so best case is O(n)
>>54410476
sleep sort.
>>54410476
Not necessary to know unless you're pajeet
bead sort. time complexity of [math]O(\sqrt{n})[/math]
>>54410476
I really like shell sort
>>54410503
i think you mean quantum bogo sort is best sort
Who cares, there's a library that will take care of it for you.
Radix sort also owns
>>54411036
what do you mean "who cares" you retarded faggot. where do you think you are? if you're dealing with huge datasets it's absolutely necessary to know about this shit and each sorting algo's respective caveats.
>>54411067
also if you're ever in a constrained environment like embedded then no, there likely won't be a library for you
inb4 that vid
>>54410567
Aren't these supposed to be the things Pajeets don't know?
>>54410684
O(n^2) space
![Day-two-of-F1-winter-testing-at-Circuit-de-Catalunya[1].jpg](https://i.imgur.com/KC3ZoLm.jpg "Day-two-of-F1-winter-testing-at-Circuit-de-Catalunya[1].jpg")
>>54411158
https://www.youtube.com/watch?v=kPRA0W1kECg&t=1m56s
>>54410531
this
>>54410476
>cocktail sort
>not having average or best case info
The fuck am I looking at?
>>54411067
But radix sort is only good for sorting integers.
>>54412547
>bitonic sort
these are the official /g/ rankings
>1.stable quicksort
>2.bogobogosort
>3.sleepsort
>4.std::sort
>5.stacksort
>honorary contender: CosmicRaySort
Bubble Sort
>>54410476
>2016
>still sorting numbers
kill yourself
>>54413713
what kind of argument is that
>>54413713
>16 years after Y2K
>NOT sorting numbers
ISHYGDDT
https://www.youtube.com/watch?v=ZZuD6iUe3Pc
>>54410476
memsort
