for (i = 0; i < n; i + +) {

sequence of statements

}

Here, the loop executes n times. Thus, the sequence of statements also executes n times. Since we suppose the time complexity of the statements are O(1), the overall time for the loop is n * O(1), that is O(n). Here, the number of statements does not matter as it will enhance the running time by a constant factor and the overall complexity will be same O(n).

Posted Date: 4/4/2013 5:55:53 AM | Location : United States

Ask an Expert

Related Discussions:- For loop, Assignment Help, Ask Question on For loop, Get Answer, Expert's Help, For loop Discussions

Write discussion on For loop
Your posts are moderated

Write your message here..

Related Questions

Procedures, what is far and near procedures in system programming? what is far and near procedures in system programming?

Declaring a two dimensional array, Declaring a two dimensional array   A... Declaring a two dimensional array   A two dimensional array is declared same to the way we declare a one-dimensional array except that we state the number of elements in both di

Calculation of storage complexity, Since memory is becoming more & cheaper,... Since memory is becoming more & cheaper, the prominence of runtime complexity is enhancing. However, it is very much significant to analyses the amount of memory utilized by a prog

What is a spanning tree of a graph, What is a Spanning tree of a graph? ... What is a Spanning tree of a graph? A Spanning Tree is any tree having of vertices of graph tree and some edges of graph is known as a spanning tree.

Physical database design and sql queries, In this part, students are allowe... In this part, students are allowed to implement the following simplifications in their table and data design. o Availability for the beauty therapists don't have to be considere

Maximum degree of any vertex in a simple graph, The maximum degree of any v... The maximum degree of any vertex in a simple graph with n vertices is (n-1) is the maximum degree of the vertex in a simple graph.

Breadth-first search, Breadth-first search starts at a given vertex h, whic... Breadth-first search starts at a given vertex h, which is at level 0. In the first stage, we go to all the vertices that are at the distance of one edge away. When we go there, we

Use a random number generator to create 10 numbers, Use a random number gen... Use a random number generator to create 10 numbers between 1 and 1000 and store them in 2 different arrays.  The first array should contain the numbers as they are generated.  The

Ruby implementation of the symbol abstract data type, Ruby implementation o... Ruby implementation of the Symbol ADT Ruby implementation of the Symbol ADT, as mentioned, hinges on making Symbol class instances immutable that corresponds to the relative la

Header linked list, creation,insertion,deletion of header linked list using... creation,insertion,deletion of header linked list using c.