Complexity of the loop is “On the Order of N” time, or O(N), because it is Linear. Run time varies directly with N.

For example, let us assume that any single statement takes a constant amount of time, T. So if your statement is

i = 3;

the time it takes to run is T.

Now suppose you have a loop that runs N times:

for (int i = 0; i<N; i++)

{

i = 3;

}

It will take N*C, since you’re doing a statement that takes T time, N times.

Suppose you have two loops:

for (int i = 0; i<N; i++)

for (int j = 0; j<N; j++)

i = 3;

Now you’re running the statement N*N times, so the complexity of this code is O(N^2).

Other imaginable sequences could take sqrt(N) time. We say this are O(log N).

Everyone loves what you guys are up too. This sort of clever work and coverage! ...

Greetings! This is my first visit to your blog! We are a collection of volunte...

sir can u please send me the ckt dig n the details of this project...

Good post but I was wanting to know if you could write a litte more on this topi...

Can I get the same program without using any functions? I need simple program w...