Received: from cs.bu.edu (kfoury@fiddle [128.197.10.114]) (authenticated bits=0) by cs.bu.edu (8.12.2/8.12.2) with ESMTP id hA5MV9Ll026893; Wed, 5 Nov 2003 17:31:09 -0500 (EST) Sender: kfoury Message-ID: <3FA97A2B.1F950A50@cs.bu.edu> Date: Wed, 05 Nov 2003 17:31:07 -0500 From: "Assaf J. Kfoury" <kfoury@cs.bu.edu> Organization: Boston University X-Mailer: Mozilla 4.78 [en] (X11; U; SunOS 5.8 sun4u) X-Accept-Language: en To: "Rui Shi@cs.bu.edu" <shearer@cs.bu.edu> CC: cs320@cs.bu.edu Subject: Re: Important issue about Problem6 in Assignment8!! References: <004a01c3a3ec$0cd28b40$ae0ac580@PLshearer> Content-Type: multipart/alternative; boundary="------------4D68052E3B112085A4E13FE5" Content-Length: 2043 Status: X-Mozilla-Status: 8019 X-Mozilla-Status2: 00000000 X-UIDL: 3fa9798900000003
Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit
And you can also implement yourself a function
that selects the n-th entry in a list.
"Rui Shi@cs.bu.edu" wrote:
> Hi, all, I realilze that in problem 6, the professor ask us to
> implement lookup etc. functions using binary search. You may need
> following functions: List.nth : 'a list * int -> 'a which take a
> list and an index n, return the nth element in the list. nth (ls, 0)
> is the first element of ls. Also need to note that we should
> use String.compare (a, b) to compare 2 strings, read the text
> book. Sorry for late reminder. TF
This archive was generated by hypermail 2b29 : Fri Jan 21 2005 - 12:17:03 EST