This is a simple code I made. Can somebody tell me how to find the time complexity of this code?
Here is the code:
for(i = 0; i< n; i++) for(j =1; sum = a[0]; j <= i; j++) sum += a[j]; system.out.println (“sum of the array is” + sum);
Thank you....
Welcome to the Java Programming Forums
The professional, friendly Java community. 21,500 members and growing!
The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.
>> REGISTER NOW TO START POSTING
Members have full access to the forums. Advertisements are removed for registered users.
LinkBack URL
About LinkBacks
How to find the time complexities
This is a simple code I made. Can somebody tell me how to find the time complexity of this code?
Here is the code:
for(i = 0; i< n; i++) for(j =1; sum = a[0]; j <= i; j++) sum += a[j]; system.out.println (“sum of the array is” + sum);
Thank you....
Related threads:
Re: How to find the time complexities
What do you think the answer is? What happened when you wrote a few test programs to try it out yourself?
Useful links: How to Ask Questions the Smart Way | Use Code Tags | Java Tutorials
Static Void Games - Play indie games, learn from game tutorials and source code, upload your own games!
Re: How to find the time complexities
When looking at the complexity of code, you have to think, for a set of n elements, how long does this take to execute. Hint: the answer is not a fixed number. Hint#2: the number of lines in a loop doesn't change the complexity of the code necessarily, but the number of times you need to look through a set of n numbers can.
Reply With Quote