2 ms·
Many people need in memory databases and linked lists (or binary trees) to hash information and sort it. There's a case to be made for an OO style program wher
by bb88 9y ago
Many people need in memory databases and linked lists (or binary trees) to hash information and sort it.
There's a case to be made for an OO style program where I create an object and give it a chunk of memory to manage a B-tree, so I can keep my memory from being fragmented, but using C++ for that is serious overkill.