Does anyone know the time complexity of searching elements in hash tables in Perl? Suppose the number of elements is n.
I have no idea on how Perl automatically builds the hash function and the table. If you can tell me how it works, that is also helpful. I can analyze the algorithm myself. Cheers, Forrest Forrest Sheng Bao, BSEE, Graduate Student Dept. of Computer Science/Electrical Engineering, Texas Tech University http://narnia.cs.ttu.edu
