I have an assignment that asks me to explain the "order of complexity" of an algorithm. Can anyone explain what that question means? Does that mean what happens first and so on?
Thanks.
puppy 0 Newbie Poster
Recommended Answers
Jump to PostIf you like more informations, this is another good link:
http://en.wikipedia.org/wiki/Big_O_notation
Jump to PostWell if you don't want to bother with math notation that will probably confuse you more than you actually are, here is pretty good explanation using programmers perspective:
I hope this helps!
All 5 Replies
Micko 2 Junior Poster
If you like more informations, this is another good link:
http://en.wikipedia.org/wiki/Big_O_notation
puppy 0 Newbie Poster
Ok, thank you. I think I've got it.
muhammad amir 0 Newbie Poster
actually,in data structure couse we usually find efficiency of our code. it mean that how much our code is efficient.as your question order of growth directly proportional to time complexity and similarly time complexty directly proportional to program steps in your assignment you are required to find step count for example
for(int i=0; i<n; i++)
{
one statement execute;
}
in this example the growth order is n because the loop execute n
n is basically instance characteristics
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.