-
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
