Data Structures and Algorithms

1. give an analysis of the running time using Big-Oh notation.
   1. sum = 0;

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

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

sum++;

2. sum = 0;

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

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

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

sum++;