What is your favourite sorting algorithm?

heap sort

>not even a real sort
How pathetic!

Attached: 1518800299522.png (745x720, 418K)

sleepsort

timsort

radix sort

Shellsort is pretty cool.

Bubble since it's the only one i know.

Merge sort. Simple, parallelizable, decent worst-case performance.

because it doesn't count :^)

Radix LSD

>needing additional knowledge about your array

kek

Whatever is built in to the standard list class in the language desu.

its fucking fast for lots of ints and if you disagree i'll still like it more

Whatever one sounds the coolest in youtube.com/watch?v=kPRA0W1kECg

Does learning these algorithm useful? I tried to study them but after I've done with bubble, insertion and selection sort, and in the middle of learning merge and quicksort, I got bored and study something else.

>Does learning these algorithm useful?
No, but learning English is.

sort(x)

First of all:
>implying your data doesn't sort itself

Second:
>anno 12018 on the Holocene calendar
>kiddie "developers" think their choice of sorting algorithm is relevant in any way

sleepsort
it just werks

They're not necessary. Every language you use will either have a built in sort with good performance or a 3rd party library that does the same.
They teach sorting algorithms in school mostly as an example to teach concepts about algorithm complexity and recursion.
Practically, most of the sorting algorithms are entirely outmatched by the best ones and there's no reason to ever use them.
Just learn merge sort for the recursion experience and so you'll have that in your back pocket if you ever need to write a custom sort. (you won't)

this

Sleepsort

who the fuck is tim

I like bingobimbobopsort

which ever I find first on stack overflow

4-way inplace radix sort

He lives in Timworld

is that bingo bimbo bop sort or bingo bim bob op sort?

I don't think the distinction is important, but the former.

Gay
Gaylord

because no one sorts integers

people sort auxiliary data by integer keys

sort by date

layered index sort
nothing better than that >inb4 memory requirements are high
only if you don't actually keep the data in memory to use it

>Not choosing stable in-place merge sort
It's literally perfect. Runner up is Tim sort.

Wasn't heap sort average and worst both n^2?

Heap sort average and worst are n*logn