Daily algorithm practice: More Big O

Here's an easy one for today. I think I spent more time opening the book than solving the problem. ;) 


This is super simple. The only algorithmically significant component is the for loop that iterates b times. The addition completed in the for loop isn't significant. So, the runtime complexity is O(b). 

I should probably put this on Github but maybe I'll just link these posts when I'm done, IDK. 

Comments

Popular posts from this blog

Dream jobs list

4w5 and 5w4: science and art

How to open Faber-Castell Pitt Artist Pens