HELP

hameed · Apr 9, 2001

Hi there!

Can someone possibly give me the analysis of the running time of the following segment using big-O notation ?

sum = 0;
for (i=0; i<n; i++)
for (j=0; j<i*i; j++)
for(k=0; k<j; k++)
sum++;

thanks a lot

Thanks · Apr 10, 2001

Don't worry folks I got the answer. That wasn't too hard. Just had trouble with sigma notations.

thanks anyway

Tek-Tips is the largest IT community on the Internet today!

Members share and learn making Tek-Tips Forums the best source of peer-reviewed technical information on the Internet!

HELP

hameed

Technical User

Thanks

Programmer

Similar threads

Part and Inventory Search

Sponsor