‎2007 May 19 9:29 AM
What exactly mean by the processing the time for the Hashed table is constant??
How can we say that time is constant... Not based on algorithm...
in a practical way !!
And what is the function code to check the attributes of the INFOTYPES..
‎2007 May 19 10:37 AM
Hi Sai,
constant time means that the record access time is independent of the number of records stored.
If the table is unsorted, the avarage search time will grow directly with the number of records. In sorted tables, the binary search will we much faster but still access time will grow with the number of records.
Using hash algorithm, a unique hash key is calculated based on records contents allowing a direct access.
Read this article about hashing techniques: <a href="http://en.wikipedia.org/wiki/Hash_table">http://en.wikipedia.org/wiki/Hash_table#Time_complexity_and_common_uses_of_hash_tables</a>
Regards,
Clemens
‎2007 May 19 10:10 AM
‎2007 May 19 10:37 AM
Hi Sai,
constant time means that the record access time is independent of the number of records stored.
If the table is unsorted, the avarage search time will grow directly with the number of records. In sorted tables, the binary search will we much faster but still access time will grow with the number of records.
Using hash algorithm, a unique hash key is calculated based on records contents allowing a direct access.
Read this article about hashing techniques: <a href="http://en.wikipedia.org/wiki/Hash_table">http://en.wikipedia.org/wiki/Hash_table#Time_complexity_and_common_uses_of_hash_tables</a>
Regards,
Clemens