In terms of performance, ArrayList / Hashtables are same, as both are derived from Array.
I would rather prefer List<T> / Dictionary<key,value> rather than them. Generics are Type safe and works faster than normal Arrays.
Also if you are looking for real performance u would better be using LinkedList<T>. It works faster for large array of data. I have seen somebody have made a good research to these. I cant find it now, but I will let u know when I find that.
So ranking :
1. LinkedList (For Large List)
2. List<T>, Dictionary<T>
3. Array, ArrayList, HashTable
:)Jameschowdare, if this helps please login to Mark As Answer. | Alert Moderator