Efficiency of arrays in LISP

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.

Thanks in advance.

.

Relevant Pages

  • Re: Efficiency of arrays in LISP
    ... I am wondering the array functions ... | on the cdr with a greater value of iterations otherwise. ... for index = (random limit) ...
    (comp.lang.lisp)
  • Re: Efficiency of arrays in LISP
    ... I am wondering the array functions ... in common lisp would be more effective (in terms of execution time) ... on the cdr with a greater value of iterations otherwise. ...
    (comp.lang.lisp)
  • Re: Norvigs use of APPPLY for MATRIX-TRANSPOSE puzzled me!
    ... so I say that an MxN matrix will ... > be matrix-transposed in MN iterations. ... > to talk about the complexity of the algorithm. ... In effect, as far as big-O notation goes, any runtime that is like M*N ...
    (comp.lang.lisp)
  • Re: Attractor set representation
    ... chris_znk@yahoo.com (Chris Zanek) wrote: ... >> complexity point of view), so I can't see how it can take longer than ... >> a minute to generate a million or so iterations, ...
    (sci.math)
  • Re: Attractor set representation
    ... chris_znk@yahoo.com (Chris Zanek) wrote: ... >> complexity point of view), so I can't see how it can take longer than ... >> a minute to generate a million or so iterations, ...
    (sci.nonlinear)