[Last Call] Learn how to a build a cloud-first strategyRegister Now

x
  • Status: Solved
  • Priority: Medium
  • Security: Public
  • Views: 310
  • Last Modified:

Can someone help me with Big O?

Will someone that is good with Big-O notation help me find the Big-O for this program fragment in C?

      sum = 0;
      for(i=1; i<n; i++)
            for(j=1; j<i*i; j++)
                  if(j%i == 0)
                        for(k=0; k<j; k++)
                              sum++;
0
tjn92
Asked:
tjn92
1 Solution
 
asian_niceguyCommented:
please see my comment on your first question regarding Big-O notation
http://www.experts-exchange.com/Programming/Q_21818669.html
0
 
WelkinMazeCommented:
You've already asked this question. You've claimed that you don't want someone else to do the work instead of you.
And it's not allowed to ask a question twice for more than 500 points.
There are enough hints in the initial thread: http://www.experts-exchange.com/Programming/Programming_Languages/C/Q_21816779.html
0

Featured Post

[Webinar] Cloud and Mobile-First Strategy

Maybe you’ve fully adopted the cloud since the beginning. Or maybe you started with on-prem resources but are pursuing a “cloud and mobile first” strategy. Getting to that end state has its challenges. Discover how to build out a 100% cloud and mobile IT strategy in this webinar.

Tackle projects and never again get stuck behind a technical roadblock.
Join Now