Array Vs Hash List

Question

What is the difference b/t Arrays and hash List? Which one is faster?

Pradeep Shet · Answer

Hash table is faster than ArrayList. ArrayList works on indexing whereas HashTable works on Key. In case of ArrayList, when you ask for any index it will iterate through the list and then fetch the desired index whereas for HashTable it will directly fetch the value based on the key. Hope this helps you. If it is so plz mark it as answered.

Munesh Sharma · Answer

AND Hash table is faster

Munesh Sharma · Answer

An ArrayList is a dynamic array that grows as new items are added that go beyond the current capacity of the list. Items in ArrayList are accessed by index, much like an array. The Hashtable is a hashtable behind the scenes. The underlying data structure is typically an array but instead of accessing via an index, you access via a key field which maps to a location in the hashtable by calling the key object's GetHashCode() method. In general, ArrayList and Hashtable are discouraged in .NET 2.0 and above in favor of List and Dictionary which are much better generic versions that perform better and don't have boxing costs for value types. http://dotnet-munesh.blogspot.in/2013/12/difference.html

Array Vs Hash List

Answers (3)