CSC 143

1.1 Suppose an algorithm takes exactly the given number of statements for each value below, in terms of an input size N. Give a tight big-Oh bound for each algorithm, representing the closest complexity class for that algorithm based on that run-time a) N Log N log N b) N2 N N log N 1000) c) N2 log N 2N d) (3 N 5 +N) e) (2N 5 N4)/N log(2N) g) N! 2N 1.2 Approximate the run-time of the following code fragments, in terms of n a) int sum 0 for (int j 1; j