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 58619
Questions about ways of storing data so that it can be used advantageously by algorithms.
1
vote
1
answer
101
views
an appropriate data-structure to represent a family of sets (Which supports exactly MAKE-SET...
I need to represent a family F of sets with some appropriate datastructure. The datastructure needs to support the procedures MAKE-SET(x), DISJOINT-UNION(A,B) and REPORT(A). I dont have a problem with …
- 83
2
votes
1
answer
648
views
Implementing SUM(i,j) and CHANGE(i,j) in O(log(n)) using a datastructure with O(n) space com...
I have two operations:
$Sum(i,j)$ : Calculate $A[i]+A[i+1]+....+A[j]$
$Change(i,x)$: Set $A[i]=x$
I need to implement these operations in an appropriate data structure using $O(n)$ space ($n$ is th …
- 83