Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Hash Tables and Linked Lists

Author: Ryan B.

Date: 00:40:10 11/02/03

Go up one level in this thread


A Hash table is just a method of storing and retrieving data fast.  Hash tables
are certainly not as memory efficient as linked lists but are much faster for
retrieving data.  For examples of both you can do a google search or if you have
a University book store around look for a CS163 book. (3rd term C++ or Java
depending on University)  The concept is easy to pick up with good examples.



This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.