Re: Efficiency of arrays in LISP

On 2006-10-29 22:22:52 -0500, "robinganemccalla@xxxxxxxxx" <robinganemccalla@xxxxxxxxx> said:

I have a list of data that I'm going to need to remove elements from,
and select elements from randomly. I am wondering the array functions
in common lisp would be more effective (in terms of execution time)
then using remove to remove and creating a loop that takes the car if
iterations has reached the random number, and recursively calls itself
on the cdr with a greater value of iterations otherwise. Coding
complexity is not an issue.

Also consider a hash table if you really need to remove items.

.

Relevant Pages