Question

Write a Perl program that uses a hash and a large number of operations on the hash. For example, the hash could store people’s names and their ages. A random- number generator could be used to create three- character names and ages, which could be added to the hash. When a duplicate name was generated, it would cause an access to the hash but not add a new element. Rewrite the same program without using hashes. Compare the execution efficiency of the two. Compare the ease of programming and readability of the two.

Answer 1

Answer:

The Perl code is attached in the attachment. The execution time for using hashes is 0 seconds while that for without hash is 27 seconds.

Explanation:

In terms of ease of access and readability, both approaches are similar. However, it is evident from the time of execution that the with hashes is more efficient than the value of without hashes. This indicates that using hashes is more efficient.