Tacosort

I found my new favorite sorting algorithm! It's called Tacosort, and its complexity is O(n*2^(k*n)), where n is the number of elements to be sorted and k is the bit size of each element.

http://web.ics.purdue.edu/~mabernar/tacosort/

So far my longest record is taking 1,269,829,745 tries to sort a 4-element array.