Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
What is the best data structure I can use for my matrix that will contain short variables but most of elements are empty..
I could simply use n by b array for the matrix but the problem is that I don’t want to waste the memory because only a few elements are in the matrix..
I was going to use a linked list or a hash table but not sure which one would be the best data structure and how to implemente this..
I would implement a Sparse Matrix. Use a
HashMapwith the row index as keys, and then either aHashMaporTreeMapfor the actual elements (with the column index as key). If you are storing primitive types, I would suggest having a look at the Trove Java Collections Framework. It is optimized for use with primitive types. I would suggest using it anyway, as the keys could all be primitive.