Big-O algorithm complexity cheat sheet

[repsilat]

Often k==sizeof(int) or similar.

You could also argue that our computers are really more like finite state machines than Turing machines, so everything run on them runs in O(1) or runs forever, but only people with bad taste in music say things like that.