Binary digits: Difference between revisions
Content added Content deleted
(→{{header|AppleScript}}: Added two straightforward solutions.) |
(Added Wren) |
||
Line 4,650: | Line 4,650: | ||
110010 |
110010 |
||
1110000100</pre> |
1110000100</pre> |
||
=={{header|Wren}}== |
|||
<lang ecmascript>var toBinary = Fn.new { |n| |
|||
if (n == 0) return 0 |
|||
var neg = false |
|||
if (n < 0) neg = true |
|||
var bin = "" |
|||
while (n > 0) { |
|||
bin = bin + "%(n%2)" |
|||
n = (n/2).floor |
|||
} |
|||
return (neg) ? "-" : "" + bin[-1 .. 0] |
|||
} |
|||
System.print("Converting to binary:") |
|||
for (i in [5, 50, 9000]) { |
|||
System.print("%(i) -> %(toBinary.call(i))") |
|||
}</lang> |
|||
{{out}} |
|||
<pre> |
|||
Converting to binary: |
|||
5 -> 101 |
|||
50 -> 110010 |
|||
9000 -> 10001100101000 |
|||
</pre> |
|||
=={{header|X86 Assembly}}== |
=={{header|X86 Assembly}}== |