31:T50b,graphViz = (tree) => { if (tree instanceof BinaryTree) { let result = `digraph{`; let count = 0; let traverse = (root) => { if (root.node) { if (root.node.left.node) { //result += `${root.node.entry.key} [label=${root.node.entry.toString()}]\n`; result += `${root.node.left.node.entry.key} [label="${root.node.left.node.entry.toString()}" shape=${root.node.left.node.entry.shape}]\n`; result += `<${root.node.entry.key}> -> <${root.node.left.node.entry.key}>;\n`; traverse(root.node.left) } else { // result += 'null'+(++count)+'[shape = none, label=""];\n'; // result += `< ${root.node.toString()} > -> ${'null'+count} [arrowhead="tee"];\n`; } if (root.node.right.node) { result += `${root.node.right.node.entry.key} [label=${root.node.right.node.entry.toString()}]\n`; result += `<${root.node.entry.key}> -> <${root.node.right.node.entry.key}>;\n`; traverse(root.node.right); } else { // result += 'null'+(++count)+'[shape = none, label=""];\n'; // result += `< ${root.node.toString()} > -> ${'null'+count} [arrowhead="tee"];\n`; } } } traverse (tree) return result + "}" } }32:[] 2f:{"title":"Position numeral system","cells":[{"id":0,"value":"# Position numeral system","pinned":false,"hidden":false,"mode":"md"},{"id":2953,"value":"viewof inputNumber = Inputs.range([0,100000], {value: 928, step:1,label:\"Number\"})","pinned":false,"hidden":false,"mode":"ojs"},{"id":2868,"value":"viewof inputBase = Inputs.select(new Map([['Binary',2],['Decimal',10]]),{value:10, label:\"Base of the num\"})","pinned":false,"hidden":false,"mode":"ojs"},{"id":2989,"value":"### Decomposition\nA digit's value is the digit multiplied by the value of its place. ","pinned":false,"hidden":false,"mode":"md"},{"id":3016,"value":"formatDecomposition(inputNumber,inputBase)","pinned":false,"hidden":false,"mode":"ojs"},{"id":2871,"value":"draw(digitFactorsTree(inputNumber,inputBase))","pinned":false,"hidden":false,"mode":"ojs"},{"id":2862,"value":"## Usage","pinned":false,"hidden":false,"mode":"md"},{"id":3070,"value":"When you need to multiple two numbers, you decompose the digits of the second number (b) by its positions. The result is the sum of the multiplication results - the multiplication of the first number (a) * element of the decomposition of the second number (b).","pinned":false,"hidden":false,"mode":"md"},{"id":3095,"value":"","pinned":true,"hidden":false,"mode":"ojs"},{"id":2413,"value":"viewof numbers= {\n const range = [1,100000]\n const inputs = [\n Inputs.range([...range], {value: 1111, step: 1, label:\"a\"}),\n Inputs.range([...range], {value: 11345, step:1, label:\"b\"}), \n ];\n const view = html`

${inputs}`;\n view.value = mergeInputs(inputs, []);\n return view;\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":3087,"value":"formatDecomposition(numbers[1],10)","pinned":false,"hidden":false,"mode":"ojs"},{"id":2198,"value":"formatMultipleNumbers(numbers[0],numbers[1])","pinned":false,"hidden":false,"mode":"ojs"},{"id":2456,"value":"md`##### Utilities - decomposition`","pinned":false,"hidden":false,"mode":"ojs"},{"id":2107,"value":"formatMultipleNumbers = (first, second) => {\n const borderTopStyle=\"border-top:1px solid black\";\n const array = decomposeNumberToArray(second, 10).map(\n (n, i, a) => n * first * Math.pow(10, a.length - (i + 1))\n );\n const inputNumbers = [first, second];\n return html`

\n${inputNumbers.map((n) => html.fragment`${n}
`)}\n${array.length > 1 ? array\n  .reverse()\n  .map((n, i) =>\n    i == 0\n      ? html.fragment`${n}
`\n      : html.fragment`${n}
`\n  ):''}\n${sum(array)}

`;\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":2028,"value":"formatDecomposition= (number, base) => {\n const array = decomposeNumberToArray(number,base);\n return tex`${decomposeNumberToArray(number,base).reduce((out, n,i,a) => out+= `${i!==0?' + ':''}(${n} * ${base}^{${a.length - (i+ 1)}})`,'')} = ${number}` \n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1974,"value":"composeArrayToNumber = (numberFactors, base) => {\n return sum(numberFactors.map((n,i,a) => n * Math.pow(base,a.length - (i+ 1))))\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1842,"value":"decomposeNumberToArray = (num,base) => {\n const digits = [];\n while (num > 0) {\n digits.push(num % base);\n num = Math.trunc(num / base);\n }\n //alternate\n //const digits = numbers[1].toString().split('').map(Number);\n return digits.reverse();\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":49,"value":"digitFactorsTree = (num, base) => {\n const digits = decomposeNumberToArray(num, base);\n const sums = digits\n .map((v, i, a) => composeArrayToNumber(a.slice(a.length - (i + 1)), base))\n .reverse();\n return buildTree(\n digits.map((v, i, a) => [\n sums[i],\n v * Math.pow(base, a.length - (i + 1)), \n Math.pow(base, a.length - (i + 1)),\n v\n ]),\n 0,\n generatorFactory()\n );\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":2372,"value":"sum = numbers => numbers.reduce((out,value) => out += value,0)","pinned":false,"hidden":false,"mode":"ojs"},{"id":1296,"value":"multiple = numbers => numbers.reduce((out,value) => out *= value,1)","pinned":false,"hidden":false,"mode":"ojs"},{"id":61,"value":"function buildTree(factors, i, gen) {\n const current = factors[i];\n const next = factors[i + 1];\n return BT(\n new Entry(i === 0 ? current[0] : gen.next().value, current[0]),\n BT(\n new Entry(gen.next().value, `${current[3]} * ${current[2]}`, \"record\"),\n BT(),\n BT()\n ),\n next != null\n ? buildTree(factors, i + 1, gen)\n : BT(new Entry(gen.next().value, 0), BT(), BT())\n );\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":3106,"value":"","pinned":true,"hidden":false,"mode":"ojs"},{"id":2688,"value":"generatorFactory = () => { \n function* nextId() {\n let i = 1000;\n while (true) {\n yield i++;\n }\n }\n let gen = nextId();\n return gen;\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":251,"value":"class Entry { \n constructor(key, value, shape) {\n this.key = key;\n this.value = value;\n this.shape = shape;\n }\n toString() {\n return this.value;\n }\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":138,"value":"$31","pinned":false,"hidden":false,"mode":"ojs"},{"id":145,"value":"draw = (tree) => dot`${graphViz(tree)}`","pinned":false,"hidden":false,"mode":"ojs"},{"id":40,"value":"import {BT, BinaryTree} from \"@esperanc/binary-search-trees\"","pinned":false,"hidden":false,"mode":"ojs"},{"id":134,"value":"dot = require(\"@observablehq/graphviz@0.2\")","pinned":false,"hidden":false,"mode":"ojs"},{"id":682,"value":"import {html, svg} from \"@observablehq/htl\"","pinned":false,"hidden":false,"mode":"ojs"},{"id":843,"value":"import {mergeInputs} from \"@mootari/observablehq-inputs-feature-73\"","pinned":false,"hidden":false,"mode":"ojs"},{"id":1552,"value":"import {cartesianPlane, segment, circle, square, rectangle, curves,lines, annotation, points, triangle} from \"@fengyfei/math-visualization\"","pinned":false,"hidden":false,"mode":"ojs"},{"id":2274,"value":"import {verticalStack,horizontalStack} from \"@rsamec/stacks\"","pinned":true,"hidden":false,"mode":"ojs"}],"files":"$W32","stdlib":"1","titling":"auto"}