Slowest sort you can think

What's the slowest non-Bogosort sort you can think of?

For me, it's
- Compute all the n! permutations of the list
- Do a breadth first search of the ordered permutation.
which, if done right, can be O(n*n!logn!).

>>34
And what do you do for a living?

>>34
You learn basic mathematics, you piece of shit.
f(x) ∈ O(g(x)) ~~ ∃k>0,x0.∀x>x0.f(x)<=g(x)*k
Look at the plot I linked. Guess what‽ At exactly x0 = 2, k = 1, for every x larger than x0, log n! is larger than log n. Holy shit!! What will that mean? Maybe that log n ∈ O(log n!) and not the other way around.
That's even written on fucking wikipedia, that's how retarded you can get.