What is the fastest way to convert a Lisp vector to a list

This is the fastest I have found so far:

(defun array-to-list (array)
  (let* ((dimensions (array-dimensions array))
         (depth      (1- (length dimensions)))
         (indices    (make-list (1+ depth) :initial-element 0)))
    (labels ((recurse (n)
               (loop for j below (nth n dimensions)
                     do (setf (nth n indices) j)
                     collect (if (= n depth)
                                 (apply #'aref array indices)
                               (recurse (1+ n))))))
      (recurse 0))))

Can anyone show me how to do this extremely fast. It would be a n length vector...unlimited elements

I would just use COERCE. But then.... why do you need this? I presume not for performance....

Cheers
--
MA

That is great, thanks...what a simple solution