# Big O state of mind

I grab the mic and jump up to the right as does my [asymptote](https://en.wikipedia.org/wiki/Asymptote). I never run more than once, man, 'cause to quote,  “Overruns become the source of overflows”. Within the walls of operations, Big O is defined. 

We conceive of memory and time, in a Big O state of mind.

Does the CPU have the juice? The clue is in the queue if you don’t want to lose out to [complexity](https://en.wikipedia.org/wiki/Computational_complexity_theory) in a [while do { }](https://en.wikipedia.org/wiki/While_loop). Be in a Big O state of mind.

What more could you ask for? When I, operate in [constant time](https://en.wikipedia.org/wiki/Time_complexity#Constant_time)? If you complain about how big the data is, this algo loves it though. It goes like a pro, "Go go gadget!", to the beat of the algo rhythm.

When I'm [recursing](https://en.wikipedia.org/wiki/Recursion_(computer_science) I bless the [call stacks](https://en.wikipedia.org/wiki/Call_stack) and [tail call](https://en.wikipedia.org/wiki/Tail_call) optimise them. Sprinkle some holy water, cross the compiler, [O(log)N](https://en.wikipedia.org/wiki/Logarithmic_growth) is my bridge over disordered waters. Double the input and it only needs one more step over.

[Linear](https://en.wikipedia.org/wiki/Time_complexity#Linear_time) takes one pass, but [X squared](https://en.wikipedia.org/wiki/Time_complexity#Sub-quadratic_time) is to be feared. [Cubic? Exponential?](https://en.wikipedia.org/wiki/Time_complexity#Polynomial_time) [Deadlock](https://en.wikipedia.org/wiki/Deadlock) is what they deserve.

Yeah, yeah I'm checking the space-time.

And I'm gonna move the perf line.

Yea, yeah, I’m in a Big O state of mind.

Inspired by [Song lyrics generator](https://www.song-lyrics-generator.org.uk/)