Anonymous user
VList: Difference between revisions
m
task added
m (in fact, we probably don't need to know the inventor either) |
m (task added) |
||
Line 18:
* Access near the end of the list can be as expensive as O(log ''n''); it is only constant on average over all elements. This is still, however, much better than performing the same operation on cons-based lists.
* Wasted space in the first block is proportional to ''n''. This is similar to linked lists, but there are data structures with less overhead. When used as a fully persistent data structure, the overhead may be considerably higher and this data structure may not be appropriate.
'''Task'''
The task is to demonstrate creation and utilization of a VList.
=={{header|C++}}==
| |||