New answers tagged data-structures
1
vote
How to maintain completely dynamic convex hull quickly?
You can use my code. I implemented the ideas from the paper by Overmars and van Leeuwen.
https://github.com/sumeetshirgure/DynamicPlanarHull/tree/master
0
votes
Use of pointers in linked list
That's poorly written, confusing code, and it would be better not to study it too closely. That said, there is a good reason it takes a Node**. The pointer to the ...
1
vote
Memory efficient undo data structure
Yes. A relevant technical term is 'persistent data structure'. (See also persistent-data-structure.) There are many techniques for building persistent versions of standard data structures (trees, ...

D.W.♦
- 154k
-1
votes
What are the examples of scalable and non-scalable data structures?
According to me the scalble and non-scalble data can be illustrated as follows:
Non-Scalble data: The Non-Scalble data is nothing but the data for a software, algorithm, ect . Which is not in that ...
Top 50 recent answers are included
Related Tags
data-structures × 2130algorithms × 749
trees × 223
binary-trees × 207
search-trees × 188
graphs × 164
heaps × 134
algorithm-analysis × 125
time-complexity × 121
hash-tables × 105
arrays × 101
balanced-search-trees × 88
runtime-analysis × 67
search-algorithms × 67
computational-geometry × 66
sets × 58
strings × 56
hash × 56
sorting × 55
binary-search-trees × 54
linked-lists × 54
terminology × 50
amortized-analysis × 49
complexity-theory × 48
priority-queues × 48