>He uses a O(n log n) sort!
>Wow he probably hasn't even kissed a girl!
I'm a heterosexual female and what's wrong with O(n log n) sorting algorithms?
>>52223281
it's an easy theorem that nlogn is a lower bound for comparison-based sorting; you could tighten that to theta
>>52223309
>theta
>a lower bound
>>52223281
>not representing all data as integers and using a radix sort
>>52223332
"tighten" he's fine
>>52223304
absolutely nothing. first year CS students are unstoppable shitposters on this Vietnamese White Rice Farming Advice Forum
>>52223281
>female niggers
this is bait
>>52223513
>"tighten" he's fine
Okay, show me the proof for upper bound of comparison based sorting algorithms
>>52223281
you can't create a general sorting algorithm with better performance than n(log(n))
inb4 radix sort I said general
this bait = shit
>>52223762
>inb4 radix sort I said general
See >>52223343
>>52223762
You can use radix-sort-esque techniques on everything. Edward Kmett is working on it: https://youtu.be/cB8DapKQz-I
>>52223281
That is this "O(bla bla)"
tell me
