Step1. A comparison between Sorted Table and Hashed Table. Reading record from Sorted table uses Binary Search but the searching on a Hashed table performed by Internal Hash Algorithm. The searching cost grows on the Sorted table if the number of records increases but the searching cost on the Hashed table is always constant regardless of the number of records. So uses of Hashed table is more faster than the sorted table.
Step2. O/P of five consecutive runs: