Ask your own question, for FREE!
Discrete Math 22 Online
OpenStudy (anonymous):

Give a big-O estimate for the number additions used in this segment of an algorithm. t := 0 for i := 1 to n for j := 1 to n t := t + i + j

OpenStudy (anonymous):

The composition of functions has their big-O estimates multiplied. In this case: \(O(n\times n\times 1) = O(n^2)\)

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!