Reputation
Next privilege 125 Rep.
Vote down
Badges
1
Impact
0 people reached

  • 0 posts edited
  • 0 helpful flags
  • 0 votes cast
Sep
24
awarded  Autobiographer
Jul
26
comment Big-O of this algorithm?
@Fallen, concerning big-O notation you are completely on the wrong track. For sure are 3 nested loops of length bounded by n enough to prove that there is a C such that C x N is an upper bound. You are arguing about a lower bound.
Jul
26
comment Big-O of this algorithm?
I have the impression that you are trying to prove a lower bound. Big-O is looking for an upper bound. Stating that the algorithm is O(n^3) is trivial. Omega(n^3) is the difficult part.
Jul
26
comment Big-O of this algorithm?
You should perhaps first read up about the differences between big-O, Omega, Theta and little-o. Big-O asks if a function is a upper bound. First there is no the bounding function, but the trick of big-O is that this is a whole family of functions. Then you should much more interested in a lower bound of the complexity (Omega) then in an upper bound big-O.
Jul
26
comment Big-O of this algorithm?
who is voting this down? this answer is correct. It is O(n^3). That it is maybe also O(n^2) doesn't contradict this, O(n^2) is included in O(n^3).
Sep
16
comment Schemes to resolve deadlocks
If an algorithmic scheme allows by some trick to recover when a deadlock occurs, by definition such a situation must be detectable beforehand and can thus entirely avoided. Or said otherwise, if you have an algorithm that potentially goes into deadlock, change your design.
Feb
27
comment If you need more than 3 levels of indentation, you're screwed?
@jokon, @Steve, @larsmans: You should really see this quote in its context. This gives you all explanations that you are looking for: computing.llnl.gov/linux/slurm/coding_style.pdf