O(1) Sorting algorithm, from http://pastebin.com/LP5sxLyx

ConwaySort.c

#include <stdio.h>
#include <stdlib.h>
/**
 * ConwaySort:
 * sorts an array by ignoring it and then
 * printing out a new, sorted array with its
 * own "Alternative Values."
 * 
 * If the new array does not appear sorted,
 * you have been manipulated by MSM
 */

// The array to be sorted
int arr[] = {6, 8, 3, 9, 5, 4, 1, 7, 0, 2};

int main(int argc, char **argv) {
	printf ("15, 16, 17, 18, 19, 20\n");
	return 0;
}