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

Examination, Write an algorithm for binary search. What are its limitations... Write an algorithm for binary search. What are its limitations? .

Comp. sci algorithms, 1. develop an algorithm which reads two decimal numbe... 1. develop an algorithm which reads two decimal numbers x and y and determines and prints out wether x>y or y>x. the input values, x and y, are whole number > or equal to 0, which

Bubble sort, #question bubble sort.. #question bubble sort..

Algorithm for binary search, Q. Write down the algorithm for binary search.... Q. Write down the algorithm for binary search. Which are the conditions under which sequential search of a list is preferred over the binary search?

Find error for curious number, #include #include int sumFact(int numb);... #include #include int sumFact(int numb); int calculateFactorial(int digit); main() { int numb, sumfact; do{ printf ("Enter a number 1 to 9999\n"); scanf("%

Define about the inheritance hierarchy, Define about the inheritance hierar... Define about the inheritance hierarchy Languages Eiffel and D provide constructs in language for invariants and pre- and post conditions which are compiled into the code and ar

Lilz, I need to know about data structure and algorithms. can you help me? I need to know about data structure and algorithms. can you help me?

Define threaded binary tree, Threaded Binary Tree:- By changing the NUL... Threaded Binary Tree:- By changing the NULL lines in a binary tree to special links known as threads, it is possible to perform traversal, insertion and deletion without using

Er diagram, Ask queConsider the following functional dependencies: Applican... Ask queConsider the following functional dependencies: Applicant_ID -> Applicant_Name Applicant_ID -> Applicant_Address Position_ID -> Positoin_Title Position_ID -> Date_Position_O

Write an algorithm inputs speed of cars using pseudocode, Write an algorith... Write an algorithm by using pseudocode which: Inputs top speeds of 5000 cars Outputs fastest speed and the slowest speed Outputs average speed of all the 5000 cars