shitsort 1.2.0

Really really bad sorting algorithms

How to use

pip install shitsort

example usage:

import shitsort

myarray = [1, 5, 12, 6, 6, 11]

print(shitsort.bogosort(myarray))
print(shitsort.multibogosort(myarray, 4)) # uses 4 processes
print(shitsort.bozosort(myarray))
print(shitsort.slowsort(myarray))
print(shitsort.permutationsort(myarray))
print(shitsort.multipermutationsort(myarray, 4)) # uses 4 processes

>>> [1, 5, 6, 6, 11, 12]
>>> [1, 5, 6, 6, 11, 12]
>>> [1, 5, 6, 6, 11, 12]
>>> [1, 5, 6, 6, 11, 12]
>>> [1, 5, 6, 6, 11, 12]
>>> [1, 5, 6, 6, 11, 12]

functions:

bogosort(array)

returns a new sorted array of array using the bogosort algorithm without modifying the passed in array. (pseudocode)

multibogosort(array, numthreads)

returns a new sorted array of array using the bogosort algorithm without modifying the passed in array, but on multiple processes simultaneously. The number of processes can be specified with numthreads. Causes absurd CPU usage.

bozosort(array)

returns a new sorted array using the bozosort algorithm, without modifying the passed in array. (paper includes pseudocode somewhere)

slowsort(array)

returns a new sorted array using the slowsort algorithm, without modifying the passed in array. (pseudocode)

permutationsort(array)

returns a new sorted array by creating every permutation of the passed in array and looking through them. Uses absurd amounts of memory.

multipermutationsort(array, numthreads)

returns a new sorted array by creating every permutation of the passed in array and looks through it on numthreads processes. Uses absurd amounts of memory and CPU.

_{contributors: sh6heer, jas-dzied}

_{Licensed under GPL GNUv3}