loading...
markdown guide
 

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.

Classic DEV Post from Jun 1 '19

Demystifying Open Source Contributions

Jordan Irabor profile image
A software engineer sitting in front of two desks and a mechanical keyboard. I build software at [Stears]('https://stearsng.com') and write tutorials for Pusher and LogRocket.