Toby Donaldson wrote:
> On 5/6/05 8:47 PM, "John Zelle" <[EMAIL PROTECTED]> wrote:
>
>>For the record, it's very easy in LISP to implement a Queue using a
>>cons-pair with car pointing to the front of a linked list and cdr
>>pointing to the back. Using such a structure, constant time enqueue an
On 5/6/05 8:47 PM, "John Zelle" <[EMAIL PROTECTED]> wrote:
>
>
> Toby Donaldson wrote:
For instance, to write an efficient queue data structure (where adding
and removing form the queue are always constant-time operations) in
LISP/Scheme requires using arrays.
>>>
>>> Hi Toby,
>
