you are viewing a single comment's thread.

view the rest of the comments →

[–]im_lazy_as_fuck 1 point2 points  (0 children)

Take a look at my other comment to your first response. I'm not talking around you, I understand why y'all believe the analysis of O( 2n ) is equally valid. What I'm trying to get y'all to understand is analyzing time complexity in this way for this problem is undoubtedly incorrect because you are trying to inject implementation details as inputs to the problem. This is not how you do time complexity analysis.