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

Find the optimal control, 1. Use the Weierstrass condition, find the (Stron... 1. Use the Weierstrass condition, find the (Strongly) minimizing curve and the value of J min for the cases where x(1) = 0, x(2) = 3. 2. The system = x 1 + 2u; where

The various ways in which lc code can be accessed, Problem Your LC code... Problem Your LC code is stored in a memory location as shown and the variable name is LC                  LC Memory address       Content(LC code)

The quick sort algorithm exploit design technique, The quick sort algorithm... The quick sort algorithm exploit design technique Divide and Conquer

EM13845162, Do you have a library solution for this problem? Do you have a library solution for this problem?

What is Polyphase Sort, One of the best known methods for external sorting ... One of the best known methods for external sorting on tapes is the polyphase sort. Principle: The basic strategy of this sort is to distribute ordered initial runs of predetermi

Algorithm to build a binary tree , Q. Give the algorithm to build a binary ... Q. Give the algorithm to build a binary tree where the yields of preorder and post order traversal are given to us.

C programming, bank database bank database

Tree Traversal, If preorder traversal and post order traversal is given the... If preorder traversal and post order traversal is given then how to calculate the pre order traversal. Please illustrate step by step process

Efficiency of binary search, Each of the comparison in the binary search de... Each of the comparison in the binary search decrease the number of possible candidates where the key value can be searched by a factor of 2 as the array is divided into two halves

Binary search technique, Q. Describe the basic concept of binary search tec... Q. Describe the basic concept of binary search technique? Is it more efficient than the sequential search?         Ans : The bin ary search technique:- This tec