Permalink
Switch branches/tags
Nothing to show
Find file Copy path
Fetching contributors…
Cannot retrieve contributors at this time
21 lines (12 sloc) 921 Bytes

Bad Sorts

A collection of novel sorting algorithms

All sorting algorithms accept a space separated list of integers as command line parameters. Results are provided to stdout as a space separated list of integers.

May be compiled by running make [sortname] or make all to compile all.

rotsort

Relies on bit rot in memory to sort. Waits a year, then checks if an array of integers is sorted due to memory degradation. If not, it waits another year, which it will continue doing until the array is sorted.

scalesort

On a large enough scale, all numbers to sort are roughly equal. Relies on this to provide O(1) run time.

bigdataquicksort

Uses big data with quick sort.

conwaysort

Sorts an array by providing a sorted "Alternative Values" output. If the new array does not appear sorted, you have been manipulated by MSM. (credit to /u/Pyroan)