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
java question confused on:
What is the order of complexity of the following method?
int functionExam1 (int list[], int size)
{
int sum=0, product=1;
for (int index=0; index<size; index++) {
sum = sum +list[index];
}
for (int index2=0; index2<size; index2++) {
product = product*list[index2];
}
System.out.println(sum, product);
}
im thinking exponential order
but not too sure expert help please.
Related threads:
Re: java question confused on:
I would suggest running this with a series of inputs. What happens when N is 10? 100? 1000? 100000? How many calculations do you perform each time? Graph those out, and it'll be pretty easy to understand what's going on.
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!
Reply With Quote