As as human I always thought that lookup in something sorted is the way faster than lookup in not sorted.
But looking at this http://dotnetperls.com/sorteddictionary I can say that I was wrong.
Maybe anyone can explain why it is so ?
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.
As as human I always thought that lookup in something sorted is the way faster than lookup in not sorted.
But looking at this http://dotnetperls.com/sorteddictionary I can say that I was wrong.
Maybe anyone can explain why it is so ?
The unsorted dictionary is probably a hash map so lookup is almost O(1) assuming not too many collisions, while a lookup in a sorted list is best case O(log N)