Determine T(n) relationship between processing time and n. Then determine a big-o estimate for the number of operations used in this segment of an algorithm.

for(int i=0; i

for(int j; j=0; j

simple statement

}

}

for(int t=0; t

simple statement

simple statement

simple statement

simple statement

}

simple statement

simple statement

simple statement

simple statement