Big-Oh

A geeky clone of 2048 for programmers.

Achieve Big-Oh of 1.

Order of merging : O(2ⁿ) O(n!) O(n²) O(nlogn) O(nlog^*n) O(n) O(logn) O(loglogn) O(log^*n) O(alpha(n)) O(1)

Use your arrow keys to move the tiles. When two tiles with the same complexity touch, they merge into a faster complexity!

Can you achieve O(1)?

##License This project is currently licensed under MIT License. For more details see LICENSE.md.

Name		Name	Last commit message	Last commit date
Latest commit History 53 Commits
js		js
screenshots		screenshots
style		style
.gitignore		.gitignore
LICENSE.md		LICENSE.md
README.md		README.md
index.html		index.html