csgeek
3 years ago1,000+ Views
Some practice for all of us. Follow the images for answers. Refresh your Big-O knowledge here: http://www.vingle.net/posts/509676-O-Notation Source: http://www.sitepoint.com/time-complexity-algorithms/
2 comments
Suggested
Recent
Would it be n^2 + n?
@TechAtHeart, you are technically right, though you should simplify and keep it at O(n^2)
1
2
2