Data Structures and Algorithms

1. Express the following three functions with Big-Oh notation: f(n) = n²+3n⁴+4n+1

2. give an analysis of the running time using Big-Oh notation.

sum = 0;

for( i = 0; i < n; i++ )

sum++;

3. Show that 5n+5 is O(n). (pick c and n0)