I'm currently playing around with different (self-made) implementations of data structures to hold a large amount of (custom) data like B*Trees and Hashtables.
The goal should be to find the most efficient solution, but I don't know how to compare them by their memory consumption and general performance.
As a compiler I'm using the MinGW port.
What whould you propose for those measurements?
Thank you in advance!