Exam (elaborations)
Alg Test 1 Complexities
- Course
- Institution
Alg Test 1 Complexities Grade school multiplication complexity Theta(n^2) Brute Force Algorithm complexity Theta(2^n) How many iterations does Euclid's algorithm require in the worst case? Theta(log2(a)) iterations Merge sort recurrence T(n) = nlog(n) Binary search recurrence T(n) = log(n)
[Show more]