Hashtable VS Dictionary VS SortedDictionary VS SortedLists

[Unleashed]

okay so I been trying to update the code to current .net

I'm not the greatest when comes to arrays and hash tables and dictionary stuff and lists and LInQ

I been learning it slowly so it has helped me so, I wanted to put a thought in my head to rest.

So I did some research and found some People have ran tests to see the difference in them.

Here is what I was reading and ill post links.
Some say People like to stick to Hashtables because its .net 2.0 capable but its a great idea to update them to Dictionary and other methods because if your sorting a lot of items it can make your performance faster but 0.2222 seconds just a number I though out there..

Some Dev's like to stick to .net 2.0 because it works better one older windows unlike .net 4.0 that is mostly supported by new windows only.


http://stackoverflow.com/questions/1089132/net-hashtable-vs-dictionary-can-the-dictionary-be-as-fast

Here is the testes that was performed
http://blog.bodurov.com/Performance-SortedList-SortedDictionary-Dictionary-Hashtable/

 

[The_Real_Jeff]

Performance increases going from Hashtable to Dictionary<T> mainly come from the fact that you dont have to box and unbox types. Dictionary<T> uses Generics, which does compile time type checking and allows the compiled output to know the type inside the collection in advance, which removes the need to box/unbox. Sorted* collections require a resort every single time you add a new object to the table. This causes lots of overhead, but, if your intention is to have the list sorted at all times, this is necessity. As far as insert (add) performance between hashtable and Dictionary, your first url explains the reason accurately. While inserting(adding) on a hash table is faster because of the reasons listed in your stack overflow url, The performance comes from not having to box/unbox when actually using the items inside the hashtable.