Соединить два упорядоченных по неубыванию списка в упорядоченный по неубыванию список

(defun bowl-sorted (w v &optional acc)
  (cond ((and (null w) (null v)) (reverse acc))
        ((null w) (nconc (reverse acc) v))
        ((null v) (nconc (reverse acc) w))
        ((<= (car w) (car v)) (bowl-sorted (cdr w) v (cons (car w) acc)))
        ((bowl-sorted w (cdr v) (cons (car v) acc)))))
 
> (bowl-sorted '(1 1 2 5) '(0 3 4))
(0 1 1 2 3 4 5)

(defun merge (l1 l2)
  (cond ((null l1) l2)
        ((null l2) l1)
        ((>= (car l1) (car l2)) (cons (car l2) (merge l1 (cdr l2))))
        (t (cons (car l1) (merge (cdr l1) l2)))))
 
==> merge
 
(merge '(1 2 3 11 12 13) '(4 5 6 77 88))
 
==> (1 2 3 4 5 6 11 12 13 77 88)

(defun bowl-sorted (w v)
  (cond ((null w) v)
        ((null v) w)
        ((< (car w) (car v)) (glue w v))
        (t (glue v w))))
 
(defun glue (w v)
  (cons (car w) (bowl-sorted (cdr w) v)))
 
> (bowl-sorted '(1 1 2 5) '(0 3 4))
(0 1 1 2 3 4 5)

(defun bowl-sorted (w v)
  (cond ((null w) v) ((null v) w)
        ((< (car w) (car v)) (glue w v)) ((glue v w))))
 
(defun glue (w v)
  (cons (car w) (bowl-sorted (cdr w) v)))
 
> (bowl-sorted '(1 1 2 5) '(0 3 4))
(0 1 1 2 3 4 5)