Anonymous user
Order two numerical lists: Difference between revisions
→{{header|Common Lisp}}
m (→{{header|LabVIEW}}: I translated it from my AHK solution) |
|||
Line 63:
(list< (rest a) (rest b)))
(t (< (first a) (first b)))))</lang>
Alternate version
<lang Lisp>(defun list< (a b)
(let ((x (find-if-not #'zerop (mapcar #'- a b))))
(if x (minusp x) (< (length a) (length b)))))</lang>
=={{header|D}}==
|