uniformity

Definition one of properties for Hash algorithm map the expected inputs as evenly as possible over its output range without hash crash. Example [input]->[output] first hash algorithm A->03 B->02 C->03 second hash algorithm A->01 B->02 C->03 explanation if the uniformity of hash algorithm is high, it less create hash crush. Thus, the second hash algorithm’s uniformity is higher than the first hash algorithm conclusion high uniformity = less hash crush = higher possible to learn with O(1) of time complexity other questions Can we possible to make perfect hash algorithm that does not make any hash crush?