34

Now I get it, I did before, but this helps.
https://github.com/corkami/docs/...

I still don’t know how to go from my function to O however.

Comments
  • 8
    There are so many ways to calculate the time complexity. Master's theorem is my fav , whenever it's applicable. With some practice the analysis ain't even needed, everything begins to look obvious.
  • 7
    LOL O(n^n)

    Damn..
  • 1
    ☚ī¸
  • 1
    @benzammour yeah it takes the least amount of effort 😂.
    I like complexity analysis.
Add Comment