Welcome to the Treehouse Community
The Treehouse Community is a meeting place for developers, designers, and programmers of all backgrounds and skill levels to get support. Collaborate here on code errors or bugs that you need feedback on, or asking for an extra set of eyes on your latest project. Join thousands of Treehouse students and alumni in the community today. (Note: Only Treehouse students can comment or ask questions, but non-students are welcome to browse our conversations.)
Looking to learn something new?
Treehouse offers a seven day free trial for new students. Get access to thousands of hours of content and a supportive community. Start your free trial today.
Andrew Stevens8,301 Points
How do you identify if a function has the same best-case or worse-case complexity?
for x in data: for y in data: print(x, y)
The above is a very simple example of O(N^2), but if I were asked to identify whether this code had the same best-case or worse-case complexity how would I go about calculating that?