Another
(defun _relist (lst n)
((lambda (i / l m)
(while (and (< i n) (setq v (Car lst)))
(setq l (cons v l)
i (1+ i)
lst (cdr lst))
)
(append (reverse l) (reverse lst))
)
0
)
)
@ hanhphuc
You just have to go the other way than the rest of us don't you.. < n before l st >
(defun revnth (n lst)...
(defun foo (i l / n k)...