Let $x \in \{ \log n, n, \dots , n!\}$ some (cost) function.Are there interesting operations with runtime in $O(x)$ on lists which also have runtime in $O(x)$ on hash tables?
Operation with same asymptotic cost on hash tables and lists
data structures;hash tables;lists