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 data-structures
Search options not deleted
user 20335
Questions regarding efficient storage and representation of data within a software application.
11
votes
Accepted
Strategy/algorithm to divide pot to chips
It sounds to me like you are attempting to solve the Knapsack Problem if you want a general solution where any denominations would work.
Put in those terms this is an unbounded knapsack problem where …
- 636
4
votes
What is the usage of Splay Trees in the real world?
It is important to note that hash tables only have average access time of O(1). This means a particular operation could be much worse. Additionally, there are several requirements for properly formed …
- 636