Big O complexity of simple for not always linear?

Posted by i30817 on Stack Overflow See other posts from Stack Overflow or by i30817
Published on 2010-03-16T01:26:57Z Indexed on 2010/03/16 1:29 UTC
Read the original article Hit count: 368

Filed under:

theory

|

complexity

|

big-o

I'm sure most of you know that a nested loop has O(n^2) complexity if the function input size is n

for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
...
}
}

I think that this is similar, by a analogous argument, but i'm not sure can anyone confirm?

for(int i = 0, max = n*n; i < max; i++{
...
}

If so i guess that there is some kinds of code whose big O mapping is not immediately obvious besides recursion and subroutines.

© Stack Overflow or respective owner

Related posts about theory

Why does NUnit ignore datapoints when using generics in a theory

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm trying to make use of the TheoryAttribute, introduced in NUnit 2.5. Everything works fine as long as the arguments are of a defined type: [Datapoint] public double[,] Array2X2 = new double[,] { { 1, 0 }, { 0, 1 } }; [Theory] public void TestForArbitraryArray(double[,] array) { // ... } It… >>> More
How do you deal with translating theory into practice?

as seen on Programmers - Search for 'Programmers'
Hello all! Being a computer scientist in a research field I am often tasked with working alongside professionals outside of the software domain (think math people, electrical engineer etc), and then translating their theories and ideas into real-world implementations. I often find it difficult when… >>> More
Title Tag Optimization - Common Grounds Between Raw SEO Theory & Search Engine Marketing Priorities

as seen on Ezine Articles - Search for 'Ezine Articles'
All you have to know about how to properly optimize title tag if you're just starting an onpage optimization campaign. Plus some easy to implement marketing tips to attract endless visitors to your content. >>> More
Database theory - relationship between two tables

as seen on Stack Overflow - Search for 'Stack Overflow'
I have a database with two tables - let's call them Foo and Bar. Each foo may be related to any number of bars, and each bar may be related to any number of foos. I want to be able to retrieve, with one query, the foos that are associated with a certain bar, and the bars that are associated with a… >>> More
Recommended book about parallel programming - theory & best practice?

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm looking for a book or books about multicore, multithreaded programming. The perfect book should focus on best practices and maybe include a bit of theory background. I'm not interested in a book which only describes a single library and focuses on its API. OS actually doesn't matter. >>> More

Related posts about complexity

Linear complexity and quadratic complexity

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm just not sure... If you have a code that can be executed in either of the following complexities: A sequence of O(n), like for example: two O(n) in sequence O(n²) The preferred version would be the one that can be executed in linear time. Would there be a time such that the sequence… >>> More
When should complexity be removed?

as seen on Programmers - Search for 'Programmers'
Prematurely introducing complexity by implementing design patterns before they are needed is not good practice. But if you follow all (or even most of) the SOLID principles and use common design patterns you will introduce some complexity as features and requirements are added or changed to keep… >>> More
Using Completed User Stories to Estimate Future User Stories

as seen on Programmers - Search for 'Programmers'
In Scrum/Agile, the complexity of a user story can be estimated in story points. After completing some user stories, a programmer or team of programmers can use those experiences to better estimate how much time it might take to complete a future user story. Is there a methodology for breaking down… >>> More
Finding complexity of a program as a service [on hold]

as seen on Programmers - Search for 'Programmers'
I would like to find the complexity of a specific code chunk written in Java. Is there a place/web site/service where I can find out the complexity of any arbitrary program. This program might include loops/recursion. Using theory we can compute complexity ourselves. But, just curious in finding… >>> More
Form, function and complexity in rule processing

as seen on Geeks with Blogs - Search for 'Geeks with Blogs'
Tim Bass posted on ‘Orwellian Event Processing’. I was involved in a heated exchange in the comments, and he has more recently published a post entitled ‘Disadvantages of Rule-Based Systems (Part 1)’. Whatever the rights and wrongs of our exchange, it clearly failed to generate any agreement or understanding… >>> More