Tagged Questions
The complexity tag has no wiki summary.
8
votes
7answers
216 views
When should complexity be removed?
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 ...
14
votes
2answers
138 views
Is there a correlation between complexity and reachability?
I've been studying cyclomatic complexity (McCabe) and reachability of software at uni recently. Today my lecturer said that there's no correlation between the two metrics, but is this really the case?
...
2
votes
1answer
156 views
Will Internet Explorer's foundation in D/COM be the cause for IE to lose the browser war? [closed]
Whatever your feelings for COM, it is a simple fact that COM forms the foundation of several Microsoft products, primarily Window itself and Internet Explorer.
I have noticed that the extention ...
1
vote
1answer
73 views
Algorith analysis refresher help
I haven't touched algorithm complexity stuff in quite a while, so I am trying to do a refresher.
I am trying to figure out the number of steps in the following for loop.
for(i = 0; i < n; ...
3
votes
5answers
264 views
How can I know when my application is too complex?
I'm currently working on my own project for an Android app, but then as time goes it feels like my app is concentrating more on another feature than what I had in mind when I first design the app.
So ...
3
votes
4answers
99 views
Efficiently implementing a prime sieve [closed]
I've been trying to solve a class of problems that require the generation of 1st n prime numbers. Now, n may be large, so completely fitting (2..n) in memory as required by some sieve techniques isn't ...
8
votes
5answers
264 views
Is the concept of computational complexity important for software developers?
I was under the impression that the concepts of time and memory complexity are a must for graduates of compsci courses, but having studied engineering I have no knowledge if that is the case. I have ...
2
votes
1answer
135 views
How costly are the Python dict and set in-built types?
I have undertaken a project concerning database deduplication. I did some research and have found that the Python dict type actually is a hashmap that uses open addressing.
In the deduplication ...
2
votes
6answers
260 views
Why is the formal definition of Big O notation formulated as such?
Consider the formal definition:
f(n) = O(g(n))
Why is it not:
f(n) = O(f(n))
or
f(n) = O(c*f(n))
since for the Big O analysis, f(n)=2n and g(n)=n are identical?
I am ...
4
votes
4answers
275 views
Big-O for nested loop
I am reading this post on Big-O
It says that the following code is O(n^2):
bool ContainsDuplicates(String[] strings)
{
for(int i = 0; i < strings.Length; i++)
{
for(int j = 0; j ...
2
votes
4answers
152 views
Difference between complexity and performance guarantee
I'm a bit confused with the performance guarantee and complexity of selection sort.
I checked through internet and the complexity of selection sort is O(n^2). This O(n^2) is in terms of time ...
2
votes
6answers
147 views
Complexity vs maintainability in modern hardware
Today with the modern hardware and memory coming cheap, how much sense does it make to spend effort to analyze algoriths or data structure complexity?
Wouldn't it be better instead, to focus on clean, ...
4
votes
2answers
130 views
Is there a correlation between code complexity and developer productivity?
Is the time spent refactoring a code base worth it in the long run, in terms of developer productivity?
It seems pretty clear to me that modifying a clean, well designed system is much simpler and ...
1
vote
2answers
77 views
complexity of suffix tree question [closed]
Build a suffix tree from a string.
While creating the suffix tree, count re-occurrences of every substring and save it on the number of occurrences on the node.
Then do a BFS search on the tree (from ...
11
votes
7answers
772 views
What is O in Big O?
What is Big and O in Big O notation? I've read the definitions and it doesn't tell what is O pronounced as 'oh'. For example - I understand that O(n) is complexity of a linear algorithm where n could ...
