O(1) sorting algorithm. http://pastebin.com/LP5sxLyx

O(1) sorting algorithm. http://pastebin.com/LP5sxLyx

#include

#include

/**

* 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, 20n”);

return 0;

}

Can’t really argue with the assertion that Preact is the JS framework to beat.

Can’t really argue with the assertion that Preact is the JS framework to beat. Basically it’s a drop in replacement for React which is surprisingly slow (around the same speed as the latest version of AngularJS).

Interesting also that VueJS really holds its own when it comes to performance.

https://developit.github.io/preact-perf/

https://preactjs.com/

https://vuejs.org/

No inclusion of Angular 2 in these tests unfortunately.