Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!samsung!think.com!compass!worley From: worley@compass.com (Dale Worley) Newsgroups: comp.lang.c Subject: Re: What Data Structure? Message-ID: Date: 25 Jun 91 14:41:42 GMT References: <1991Jun24.110300.3740@ecsvax.uncecs.edu> Sender: root@compass.com Organization: Compass, Inc., Wakefield, MA, U.S.A. Lines: 15 In-reply-to: burgin@ecsvax.uncecs.edu's message of 24 Jun 91 11:03:00 GMT In article <1991Jun24.110300.3740@ecsvax.uncecs.edu> burgin@ecsvax.uncecs.edu (Robert Burgin) writes: I am writing a program that includes a dictionary look-up of 24,500 English words. Would a hash table be best for the implementation? Or a trie? Why? What are you going to *do* with the dictionary? As in all data-structure questions, you have to first figure out what you are going to do with it before you know which data structure to use. Dale Worley Compass, Inc. worley@compass.com -- toy dog [toi-dawg] n. Any of several breeds of small dogs, often high-strung. Syn: yip-yip, yip-dog, microwave delight.