Problem
1.Show that [f(n)] is O(f(n)), if f(n) is a positive nondecreasing function that is always greater than 1.
2. Algorithm A executes an O(logn)-time computation for each entry of an n-element array. What is the worst-case running time of Algorithm A?