SortedList vs Hashtable

Question

Hi Can any one tell me what is difference b/w SortedList and HashTable...?

Vulpes · Answer

The difference between them is that in the SortedList the key/value pairs are sorted by key and since they have a definite order you can access them by index as well as by key. In the HashTable the key/value pairs are not sorted and you can only access them by key. This means that random insertions for the SortedList are relatively slow because it needs to be resorted after each insertion. On the other hand in some applications it is useful to be able to iterate through the keys in sorted order.