Big O notation

I just figured out a simple way to understand BigO notation, aka the algorithm complexity numbers. Let's say you have your myFn function and inside it you have some logic (an algorithm) that takes som