tag:blogger.com,1999:blog-7997402329705633660.post5971290621871990980..comments2023-07-24T10:07:48.274-04:00Comments on Microsoft Dot Net: C# Hashtable vs Dictionary vs Array vs ArrayList vs List search performance comparisonVivekhttp://www.blogger.com/profile/08541974152182708949noreply@blogger.comBlogger7125tag:blogger.com,1999:blog-7997402329705633660.post-25705602511255121672015-02-05T03:35:46.104-05:002015-02-05T03:35:46.104-05:00Check this one too....Dictionary Vs Hashtable
Lin...Check this one too....<a href="http://net-informations.com/faq/general/dictionary.htm" rel="nofollow">Dictionary Vs Hashtable</a><br /><br />Ling<br />lingmaakihttps://www.blogger.com/profile/09477565569807599471noreply@blogger.comtag:blogger.com,1999:blog-7997402329705633660.post-51745324623541893092014-04-23T03:10:58.906-04:002014-04-23T03:10:58.906-04:00this make sanse to me
this make sanse to me <br />Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-7997402329705633660.post-83021165556004526462014-01-06T19:36:21.952-05:002014-01-06T19:36:21.952-05:00Thanks, I had a problem similar to this and I was ...Thanks, I had a problem similar to this and I was wondering about performance.<br /><br />In general;<br />The comparison between a dictionary and hashtable is useful.<br />The comparison between an Arraylist and List is also useful. <br /><br />Other than that, this is information helpful only if you are wanting to use a data structure where the lookup key is a string and you do not have many entries.<br /><br />When you are going through the array, you are looking at the first three entrees each time to get to Sandra. I suppose you chose that location to represent average lookup when your data set is only 5. If your data set was 1000, sequentially looking through 500 people objects would probably be significantly slower than using a hashing data structure such as a hashtable or dictionary (a hash map). <br /><br />It might be interesting to see how fast an array is if you used it as it was intended and looked up values rather than iterating through. You could write a simple hash function (get and set) that takes the first and last letters of a string and converts them to an int (char * char = index), then stores them in the proper location in the array. Then look up the items in the array using the function. <br /><br />It would also be interesting to see this same thing run with a int key lookup to a string value. That is where an array would shine. Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-7997402329705633660.post-79209506032805298462013-09-29T13:00:17.796-04:002013-09-29T13:00:17.796-04:00I am not sure what you mean. Could you please elab...I am not sure what you mean. Could you please elaborate?Vivekhttps://www.blogger.com/profile/08541974152182708949noreply@blogger.comtag:blogger.com,1999:blog-7997402329705633660.post-68131400182199815742013-09-27T11:37:49.143-04:002013-09-27T11:37:49.143-04:00You constructed the array in wrong way to get its ...You constructed the array in wrong way to get its bad performance.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-7997402329705633660.post-14153262805482785662013-09-02T02:39:13.066-04:002013-09-02T02:39:13.066-04:00ThanksThanksAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-7997402329705633660.post-36432191364180819442013-08-28T04:06:34.092-04:002013-08-28T04:06:34.092-04:00thanks!!!thanks!!!Anonymousnoreply@blogger.com