A geeky clone of 2048 for programmers.
Order of merging :
O(2n)
O(n!)
O(n2)
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.