Question: DATA STRUCTURE Assignment 2 - Algorithm analysis Problem 1. Prove that: a. 4n + 7n + 1 = O(n?) b. n? - 3n + 1

DATA STRUCTURE Assignment 2 - Algorithm analysis Problem 1. Prove that: a. 4n + 7n + 1 = O(n?) b. n? - 3n + 1 = (n) c.log(2n + k) = (log(n)), where k is a constant d. log(i) = O(n log(n)) Problem 2. Compute the computational complexity of the following loops: a. for(cnt1 = 0, i = 1; i
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
