Data Structures and Algorithms

1. Express the following three functions with Big-Oh notation: f(n) = 2log n + nlogn+2ⁿ

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

1. sum = 0;

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

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

sum++;