From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: *
X-Spam-Status: No, score=1.4 required=5.0 tests=BAYES_50,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,dd99763c8f0b15c2
X-Google-Attributes: gid103376,public
X-Google-Thread: 1014db,dd99763c8f0b15c2
X-Google-Attributes: gid1014db,public
From: dewar@merv.cs.nyu.edu (Robert Dewar)
Subject: Re: Need HELP with algorithms
Date: 1997/04/26
Message-ID: <dewar.862110360@merv>#1/1
X-Deja-AN: 237638709
References: <335FB73E.8D@aoce.is.lmsc.lockheed.com>
 <5jq8rm$12m$5@halon.vggas.com>
Organization: New York University
Newsgroups: comp.lang.ada,comp.lang.c
Date: 1997-04-26T00:00:00+00:00
List-Id: <comp.lang.ada>


James Youngman said

<<>My name is Danny Tran and I am currently looking for algorithms to
>search/merge lists. If anyone knows any books or Web sites that have
>these information please let me know. Thanks in advance.

Donald E. Knuth's "The Art of Computer Programming", Volume 2.   You may need
to read Volume 1 in order to understand partsof Volume 2 though.>>

YOu mean volume 3, volume 2 is the semi-numerical stuff, vol 3 is
searching and sorting (unless I am completely losing my memory :-)

However, these are definitely NOT easy reading, and typical texts for
undergraduate algorithms classes may be more accessible ..