Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!wuarchive!uunet!munnari.oz.au!goanna!ok
From: ok@goanna.cs.rmit.oz.au (Richard A. O'Keefe)
Newsgroups: comp.lang.misc
Subject: Re: Dynamic typing (part 3)
Message-ID: <5045@goanna.cs.rmit.oz.au>
Date: 25 Mar 91 05:38:16 GMT
References: <731@optima.cs.arizona.edu> <1991Mar20.185308.8275@maths.nott.ac.uk> <22MAR91.09242511@uc780.umd.edu>
Organization: Comp Sci, RMIT, Melbourne, Australia
Lines: 12

In article <22MAR91.09242511@uc780.umd.edu>, cs450a03@uc780.umd.edu writes:
> Examples of the second also can be done in statically typed languages,
> things like sorting, searching, and selection.  But even C (which some
> people have said we shouldn't be using as an example of a statically
> typed language) doesn't have a hashed search (for un-ordered items) in
> any of the libraries I know of.

Log on to a UNIX System V box and type
	man hsearch
It has been around for _years_.  (See also lsearch and tsearch.)
-- 
Seen from an MVS perspective, UNIX and MS-DOS are hard to tell apart.