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

x
?
Solved

Big O

Posted on 2006-04-18
3
Medium Priority
?
271 Views
Last Modified: 2010-04-17
If someone is good with Big-O notation will you help me find it for this fragment of code in C?

      sum = 0;
      for(i=0; i<n; i++)
            for(j=0; j<i*i; j++)
                  for(k=0; k<j; k++)
                        sum++;
0
Comment
Question by:tjn92
2 Comments
 
LVL 11

Accepted Solution

by:
asian_niceguy earned 200 total points
ID: 16484677
please see my comment on your first question regarding Big-O notation
http://www.experts-exchange.com/Programming/Q_21818669.html
0
 
LVL 11

Expert Comment

by:WelkinMaze
ID: 16485083
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

Free Tool: Path Explorer

An intuitive utility to help find the CSS path to UI elements on a webpage. These paths are used frequently in a variety of front-end development and QA automation tasks.

One of a set of tools we're offering as a way of saying thank you for being a part of the community.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Whether you've completed a degree in computer sciences or you're a self-taught programmer, writing your first lines of code in the real world is always a challenge. Here are some of the most common pitfalls for new programmers.
This article will show how Aten was able to supply easy management and control for Artear's video walls and wide range display configurations of their newsroom.
Loops Section Overview
Screencast - Getting to Know the Pipeline

829 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question