Order two numerical lists: Difference between revisions
Content added Content deleted
No edit summary |
(added Ol) |
||
Line 1,065: | Line 1,065: | ||
1 ok |
1 ok |
||
</pre> |
</pre> |
||
=={{header|Ol}}== |
|||
This sample very similar to Scheme, but implements proper tail recursion. So can test unlimited length lists. |
|||
<lang scheme> |
|||
(define (lexorder a b) |
|||
(cond |
|||
((null? b) #false) |
|||
((null? a) #true) |
|||
((< (car a) (car b)) #true) |
|||
((> (car a) (car b)) #false) |
|||
(else |
|||
(lexorder (cdr a) (cdr b))))) |
|||
(print (lexorder '(1 2 3) '(1 2 3 4))) ; => true |
|||
(print (lexorder '(1 2 4) '(1 2 3))) ; => false |
|||
(print (lexorder '(1 2 3) '(1 2))) ; => false |
|||
(print (lexorder '(1 2 3) '(1 2 3))) ; => false |
|||
(print (lexorder '(1 2 3) '(1 2 8))) ; => true |
|||
</lang> |
|||
=={{header|PARI/GP}}== |
=={{header|PARI/GP}}== |