DEV Community

loading...

Explain Time Complexity Like I'm Five

Jordan Irabor
A software engineer sitting in front of two desks and a mechanical keyboard. I build software at [Turing]('https://turing.com') and write tutorials for Pusher and LogRocket.
・1 min read

Guys, no better way to put this, I'm having an exam in about an hour and I want to be certain I have this thing figured out.

Quick responses would be appreciated :)

Thank you!

Discussion (1)

Collapse
jvanbruegge profile image
Jan van Brügge

I wrote an article about this in fact: dev.to

Basicly assuming you slice time in slices of fixed (!) width, how many slices do you need depending on the size of input (n).
O(1) means that no matter how big the input is, you only need a fixed amount of time. O(n) means you need as many slices as there are inputs (so bigger inputs mean longer run time) and so on.