Posted
by Codenotguru
on Stack Overflow
See other posts from Stack Overflow
or by Codenotguru
Published on 2010-04-12T19:59:14Z
Indexed on
2010/04/12
20:02 UTC
Read the original article
Hit count: 325
what is Big Oh notation mean and when an algorithm has logarithmic complexity?? for example how is quick sort O(nlogn)???
© Stack Overflow or respective owner
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
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
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
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
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
as seen on Stack Overflow
- Search for 'Stack Overflow'
What are some clever (not ordinary) ways of implementing data structures in C, and what are some data structures that should be used more often?
For example, what is the most effective way (generating minimal overhead) to implement a directed and cyclic graph with weighted edges in C?
I know that…
>>> More
as seen on Programmers
- Search for 'Programmers'
When we design applications, we generally end up with the same tiered sets of data structures:
A persistent data structure that is described using DDL and implemented as RDBMS tables and columns.
A set of domain objects that consist primarily of data structures, usually combined with business-rule…
>>> More
as seen on Programmers
- Search for 'Programmers'
I am a newbie into the corporate world recently graduated in computers. I am a java/groovy developer. I am a quick learner and I can learn new frameworks, APIs or even programming languages within considerably short amount of time. Albeit that, I must confess that I was not so strong in data structures…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hello,
I have to design a data structure that is to be used in a multi-threaded environment. The basic API is simple: insert element, remove element, retrieve element, check that element exists. The structure's implementation uses implicit locking to guarantee the atomicity of a single API call.…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
There is a large stream of numbers coming in such as 5 6 7 2 3 1 2 3 .. What kind of data structure is suitable for this problem given the constraints that elements must be inserted in descending order and duplicates should be eliminated.
I am not looking for any code just ideas? I was thinking…
>>> More
