Exam (elaborations)
CSCI570 TOP Study Guide Exam Questions and CORRECT Answers
- Course
- Institution
What is the complexity of multiplication?n^2 What does it mean for a function f(n) = O(g(n))?g(n) will grow asymptotically larger than f(n) f(n) is big O of g(n) What does an algorithm of runtime log n mean?the max runtime is proportional to the logarithm of n Is log n slower or faster than...
[Show more]