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!).

>>14
Runs at O(n!) with no upper bound.
Runs with an upper bound of n! with no upper bound?
Bogosort is O(inf).
Also, Bogosort is not a non-Bogosort sort.