Im using a Dictionary, i will have around a million entries and i will be regularly be adding, removing, editing, and polling.. im wondering what the up/down sides of all the entries will be, and if there is a more efficiant way.
Share
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.
Im using a Dictionary, i will have around a million entries and i will be regularly be adding, removing, editing, and polling.. im wondering what the up/down sides of all the entries will be, and if there is a more efficiant way.
It depends what you want to do. If you want a key-value pair store with fast insertion, lookup and removal, you can’t get much better.
But if you want to get the smallest key, a dictionary won’t help you much as you will have to search the entire dictionary. A SortedDictionary might be better in this case.
The most suitable data structure depends on what data you will store, and how will be using it. Since you haven’t told us either, it’s very hard to give a concrete answer to your question.