Created
October 25, 2020 19:40
-
-
Save SpineyPete/7a5b05a5d1753ca0fb5cdc12d309bfbf to your computer and use it in GitHub Desktop.
// source https://jsbin.com
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| <!DOCTYPE html> | |
| <html> | |
| <head> | |
| <meta charset="utf-8"> | |
| <meta name="viewport" content="width=device-width"> | |
| <title>JS Bin</title> | |
| </head> | |
| <body> | |
| <script id="jsbin-javascript"> | |
| "use strict"; | |
| // find the "binary number" as an integer | |
| // don't use anything other then + - * and / | |
| let log = [] | |
| const decimal_pseudo_binary = (n) => | |
| { | |
| let result = 0; | |
| let b2 = 1; | |
| let bit = 1; | |
| while (b2 * 2 < n) | |
| { | |
| b2 *= 2; | |
| bit *= 10; | |
| } | |
| while (b2 >= 1) | |
| { | |
| if (b2 <= n) { | |
| log.push(`result = ${result} N = ${n}, B = ${b2} remainder = ${n - b2}`); | |
| n -= b2; | |
| result += bit; | |
| } | |
| b2 /= 2; | |
| bit /= 10; | |
| } | |
| log.push(`result = ${result} N = ${n}, B = ${b2} remainder = ${n - b2}`); | |
| return result; | |
| } | |
| decimal_pseudo_binary(15); | |
| let elem = document.createElement("pre"); | |
| elem.textContent = log.join("\n"); | |
| document.getElementsByTagName("body")[0].appendChild(elem); | |
| </script> | |
| <script id="jsbin-source-javascript" type="text/javascript">"use strict"; | |
| // find the "binary number" as an integer | |
| // don't use anything other then + - * and / | |
| let log = [] | |
| const decimal_pseudo_binary = (n) => | |
| { | |
| let result = 0; | |
| let b2 = 1; | |
| let bit = 1; | |
| while (b2 * 2 < n) | |
| { | |
| b2 *= 2; | |
| bit *= 10; | |
| } | |
| while (b2 >= 1) | |
| { | |
| if (b2 <= n) { | |
| log.push(`result = ${result} N = ${n}, B = ${b2} remainder = ${n - b2}`); | |
| n -= b2; | |
| result += bit; | |
| } | |
| b2 /= 2; | |
| bit /= 10; | |
| } | |
| log.push(`result = ${result} N = ${n}, B = ${b2} remainder = ${n - b2}`); | |
| return result; | |
| } | |
| decimal_pseudo_binary(15); | |
| let elem = document.createElement("pre"); | |
| elem.textContent = log.join("\n"); | |
| document.getElementsByTagName("body")[0].appendChild(elem); | |
| </script></body> | |
| </html> |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| "use strict"; | |
| // find the "binary number" as an integer | |
| // don't use anything other then + - * and / | |
| let log = [] | |
| const decimal_pseudo_binary = (n) => | |
| { | |
| let result = 0; | |
| let b2 = 1; | |
| let bit = 1; | |
| while (b2 * 2 < n) | |
| { | |
| b2 *= 2; | |
| bit *= 10; | |
| } | |
| while (b2 >= 1) | |
| { | |
| if (b2 <= n) { | |
| log.push(`result = ${result} N = ${n}, B = ${b2} remainder = ${n - b2}`); | |
| n -= b2; | |
| result += bit; | |
| } | |
| b2 /= 2; | |
| bit /= 10; | |
| } | |
| log.push(`result = ${result} N = ${n}, B = ${b2} remainder = ${n - b2}`); | |
| return result; | |
| } | |
| decimal_pseudo_binary(15); | |
| let elem = document.createElement("pre"); | |
| elem.textContent = log.join("\n"); | |
| document.getElementsByTagName("body")[0].appendChild(elem); |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment