I want to test which data structure is the best by looking at the run-time performance of my algorithm, how do I do it?
For example I already have a hashmap<
hashmap<
You would adjust the program to perform thousands or millions of hashmap lookups, ideally chosen randomly, and time that.