in reply to Re^3: Comparing two hashes for duplicate keys with no case sensitivity
in thread Comparing two hashes for duplicate keys with no case sensitivity
Yes, join is O(n) where n in this code is the number of keys in the hash. Perl's implementation is slightly more efficient for join than Perl-side iteration, but that's why there's a join operator.
|
|---|