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,953
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