(seizure warning) ArrayV's impractical sorting algorithms 

1: Fire sort: O(2(n-1)) best, O(n^3) average and worst, O(1) memory, stable
2: Stupid fire sort: O(2(n-1)) best, O(n^4) average and worst, O(1) memory, stable
3: Reflection sort:
4: Bad sort: O(n^2) best, O(n^3) average and worst, O(1) memory, unstable
5 and 6: Stooge sort: O(n^2.71) best average and worst, O(n) memory, stable or unstable
7: Quad stooge sort: O(n^2.58) best average and worst, O(n) memory, stable or unstable
8: Silly sort: O(n^(log n)) best average and worst, O(n) memory, unstable
9: Slow sort: O(n^(log n)) best average and worst, O(n) memory, unstable
10: Snuffle sort: O(n^(log n)) best average and worst, O(n) memory, unstable
11 and 12: Hanoi sort: O(2^n) best average and worst, O(n) memory, stable or unstable
13: Napoleon sort: O(n) best, O(inf) average and worst, O(1) memory, unstable
14: Selection bogo sort:
15: Bubble bogo sort: O(n) best, O(n^3 log n) average, O(inf) worst, O(1) memory, stable
16: Cocktail bogo sort: O(n^2) best, O(n^3) average, O(inf) worst, O(1) memory, unstable
17: Markov sort: O(n) best, o(n * 2^n) average, O(inf) worst, O(1) memory, stable
18: Less bogo sort: O(n^2) best, O(n^3) average, O(inf) worst, O(1) memory, unstable
19: Exchange bogo sort: O(n) best, O(n^3 log n) average, O(inf) worst, O(1) memory, unstable
20: Median quick bogo sort:
21: Quick bogo sort:
22: Merge bogo sort:
23: Smart guess sort:
24: Bozo sort: O(n) best, O(n!) average, O(inf) worst, O(1) memory, unstable
25: Deterministic bogo sort: O(n) best, O(n * n!) average, O(n! ?) worst, O(n) memory, unstable
26: Smart bogo bogo sort:
27: Slice bogo sort:
28: Bogo sort: O(n) best, O(n * n!) average, O(inf) worst, O(1) memory, unstable
29: Optimized guess sort:
30: Random guess sort:
31: Guess sort: O(n^(n+2)) best average and worst, O(n) memory, unknown stability
32: Bogo bogo sort: O(n^2) best, O(n superfactorial n) average, O(inf) worst, O(n^2) memory, unstable