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 ds.algorithms
Search options not deleted
user 317
Questions regarding well-defined instructions for completing a task, and relevant analysis in terms of time/memory/etc.
4
votes
0
answers
288
views
Distinguishing two types of Monte-Carlo algorithms
Recall from Wikipedia that Monte Carlo algorithm is a randomized algorithm whose running time is deterministic, but whose output may be incorrect with a certain (typically small) probability. Consider …
- 795
3
votes
How can I randomly generate bounded height spanning trees?
If your problem is to uniformly sample a spanning tree from a set $S$, where $S$ is the set of all spanning trees of hight at most $h$, for some input $h$, then your strategy works (i.e., sample a ran …
- 795