Sorted Table Vs Hashed Table


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:


Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s