c# 中的哈希表数据结构（按密钥哈希排序）的目的是什么？

Question

I know that hastable datastructure will store key value pair. And that key is sorted based on the hash value.

Whereas the sorted list is the same but sorted on the actual key value rather than the hash.

What is the purpose of hash table- or in other words what is the benefit of sorting key by hash value?

Answer 1

Adding to Mark's comment on the question, it is about the speed of the lookup.

See this answer: https://stackoverflow.com/a/25194575/1691226