Hello,
I am trying to figure this out but i do not understand any of it. the question
asks give the big-o performance of the following code fragment:
for i in range(n):
for j in range(n):
k = 2 + 2
i am not sure how i am supposed to figure this out. i have been reading the
book, looking at blog posts and watching online tutorials and i still cannot
grasp the big-o. please keep in mind that i have never taken a calc course and
that i am a complete novice to programming, even more so to python. Any help
would be greatly appreciated. I am pretty much on my own with these since my
fellow students are unwilling to help me with anything since they are far more
advanced than i am.
Thank you,
Stephanie
_______________________________________________
Tutor maillist - Tutor@python.org
To unsubscribe or change subscription options:
https://mail.python.org/mailman/listinfo/tutor
