Collect and sort square numbers in ascending order from three lists: Difference between revisions
Content added Content deleted
(Added Sidef) |
Drkameleon (talk | contribs) (Added Arturo implementation) |
||
| Line 67: | Line 67: | ||
4 9 16 25 36 36 49 81 121 144 169 |
4 9 16 25 36 36 49 81 121 144 169 |
||
</pre> |
</pre> |
||
=={{header|Arturo}}== |
|||
<lang rebol>lists: [ |
|||
[3,4,34,25,9,12,36,56,36] |
|||
[2,8,81,169,34,55,76,49,7] |
|||
[75,121,75,144,35,16,46,35] |
|||
] |
|||
squares: map 1..inc to :integer sqrt max flatten lists 'x -> x^2 |
|||
square?: function [n]-> contains? squares n |
|||
print select sort fold.seed:[] lists [a,b][a++b] => square?</lang> |
|||
{{out}} |
|||
<pre>4 9 16 25 36 36 49 81 121 144 169</pre> |
|||
=={{header|AWK}}== |
=={{header|AWK}}== |
||
<lang AWK> |
<lang AWK> |
||