1 Answered Questions for the topic Complexity
09/20/14
big O complexity
for(int i = 0; i < 1; i++)for(int j = 0; j < 1; j++)a = i;what is the big O of this fragment code.i said it will be O(n2), but my teacher said it is O(n)for(int i = 0; i < n*n; i++)for(int...
more
Follows
•
2
Expert Answers
•1
![]()
Still looking for help? Get the right answer, fast.
Ask a question for free
Get a free answer to a quick problem.
Most questions answered within 4 hours.
OR
Find an Online Tutor Now
Choose an expert and meet online. No packages or subscriptions, pay only for the time you need.
