Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with algorithm-analysis
Search options not deleted
user 35688
Questions about the science and art of determining properties of algorithms, often including correctness, runtime and space usage. Use the [runtime-analysis] tag for questions about the runtime of algorithms.
2
votes
How to compare the time-complexity of an optimized algorithm with that of the original?
It appears that, before your optimization, your algorithm had the same worst- and average-case complexity, which is why it was easy to consider.
The change in asymptotic complexity really depends on …
- 608
6
votes
Accepted
Is there a more efficient algorithm than backtracking/dynamic programming?
(Throughout this answer I use $\phi = \frac{1+\sqrt{5}}{2}$, which is the Golden Ratio.)
Solution:
If $s\leq n$, the attackers can win in one day.
If $s+dpw<\phi^2n$ and $s<2n$, the attackers can w …
- 608