This week's book giveaway is in the OCAJP 8 forum. We're giving away four copies of OCA Java SE 8 Programmer I Study Guide and have Edward Finegan & Robert Liguori on-line! See this thread for details.
I have looked at HashTable, trees, etc for my situation but having a hard choosing which one is the best choice. My data might look like this each entry has: Social Security Number <- unique Company Number <- unique Job <- not-unique Age <- not-unique Now I need to be able to search Social Security Number or Company Number get the other three items I will never need to search by Job or Age. What is the best coolection for this. Also, this may or not be important but the serial numbers follow a tree structure. Any help would be welcome. Bill