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

def crs(l):
    while not all(l[i-1]<=l[i]for i in range(1,len(l))):
        pass