Re: searching for missing element in an array
Ico wrote:
For example, can you tell in advance what the sum of all
numbers [1..n] is, without actually adding them all up ?
I fail to understand how that is relevant to the problem in question.
Yes, being able to calculate the sum of integers 1-n without doing an
explicit loop is faster, but it doesn't change the O(n) complexity of
the requested algorithm.
.
Relevant Pages
- Re: searching for missing element in an array
... I fail to understand how that is relevant to the problem in question. ... explicit loop is faster, but it doesn't change the Ocomplexity of ... the requested algorithm. ...
(comp.programming) - Re: transactional file persistence?
... increase the complexity and can fail for a number of reasons. ... Well designed DBMSes have that covered. ... filesystem to experience the same level or complexity of problems. ... Are there any reason I cant make use of any of these safeguards in the ...
(comp.lang.java.help) - Re: transactional file persistence?
... Not all databases are relational, or follow relational algebra. ... increase the complexity and can fail for a number of reasons. ... It is not very common for a filesystem to experience the same level or complexity of problems. ...
(comp.lang.java.help) - Re: large binary immediately SEGVs
... >>Programs fail because their authors or maintainers fail to understand ... >>CONTROL OF COMPLEXITY is the key, and there are various approaches to ... With this "design" ... the pro's and cons here, ...
(comp.os.linux.misc) - Re: Loading Coils; was : Vincent antenna
... explanations that only work in the complexity ... For Pete's sake, Keith, Ohm's law doesn't even ... the models fail. ...
(rec.radio.amateur.antenna) |
|
