Collect and sort square numbers in ascending order from three lists: Difference between revisions
Content added Content deleted
(add FreeBASIC) |
(→{{header|Wren}}: Now uses Int.isSquare method.) |
||
Line 160: | Line 160: | ||
=={{header|Wren}}== |
=={{header|Wren}}== |
||
{{libheader|Wren-math}} |
|||
<lang ecmascript> |
<lang ecmascript>import "./math" for Int |
||
var lists = [ |
|||
[3,4,34,25,9,12,36,56,36], |
[3,4,34,25,9,12,36,56,36], |
||
[2,8,81,169,34,55,76,49,7], |
[2,8,81,169,34,55,76,49,7], |
||
Line 168: | Line 171: | ||
var squares = [] |
var squares = [] |
||
for (list in lists) { |
for (list in lists) { |
||
for (e in list) |
for (e in list) if (Int.isSquare(e)) squares.add(e) |
||
var s = e.sqrt.floor |
|||
if (s * s == e) squares.add(e) |
|||
} |
|||
} |
} |
||
squares.sort() |
squares.sort() |