[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Proposal #9 Status: Variable Name Conflicts
- To: common-lisp@SU-AI.ARPA
- Subject: Re: Proposal #9 Status: Variable Name Conflicts
- From: Jeff Barnett <jbarnett@nrtc>
- Date: Wed, 30 Jul 86 13:55:54 PDT
- Cc: Fahlman@C.CS.CMU.EDU
It was assumed in this and a previous message that looking for duplicate
names in the variable-list argument of a PROGV is an N**2 operation. Not
true. In the first place, if the list is short N**2 is small. In the
second place it can be done in N*log N time. To wit: (1) copy the list--
order n, (2) sort the list--order N*log N, and (3) search the ordered
list for adjacent duplicates--order N.
Jeff