For a couple of reasons. In some ways, this would be nicer, do expected cases, it's going to tell you on average how much you expect to take, but it tends to be hard to compute, because to compute that, you have to know a distribution on input.

关注最快的情况，在某种意义上来说，因为一些原因这样想挺不错的，当我们处理一个给定的问题,计算平均时间的时候,是很难计算的，因为你并不知道输入的分布情况,这些输入会是怎么样的呢？

麻省理工公开课 - 计算机科学及编程导论课程节选

The answer is I can't. OK, in the simple case of integers I can, but in the case of something more complex like faces or fingerprints or passwords for that matter, it's hard to design a hash function that has completely even distribution, meaning that it takes any input into exactly one output spot.

答案是我不能，好吧,在简单的整数的例子中,我可以做到，但是在一些更复杂的场景中,比如面部，指纹，密码相关的问题中，很难设计一个哈希函数具备完全平均的分配,也就是说，做到对任一输入，可以准确地得到相应的唯一输出,因此在一个哈希问题中。

麻省理工公开课 - 计算机科学及编程导论课程节选