How to resolve the algorithm Accumulator factory step by step in the Brat programming language
How to resolve the algorithm Accumulator factory step by step in the Brat programming language
Table of Contents
Problem Statement
A problem posed by Paul Graham is that of creating a function that takes a single (numeric) argument and which returns another function that is an accumulator. The returned accumulator function in turn also takes a single numeric argument, and returns the sum of all the numeric values passed in so far to that accumulator (including the initial value passed when the accumulator was created).
The detailed rules are at http://paulgraham.com/accgensub.html and are reproduced here for simplicity (with additions in small italic text).
Create a function that implements the described rules.
It need not handle any special error cases not described above. The simplest way to implement the task as described is typically to use a closure, providing the language supports them. Where it is not possible to hold exactly to the constraints above, describe the deviations.
Let's start with the solution:
Step by Step solution about How to resolve the algorithm Accumulator factory step by step in the Brat programming language
Source code in the brat programming language
accumulator = { sum |
{ n | sum = sum + n }
}
x = accumulator 1
x 5
accumulator 3 #Does not affect x
p x 2.3 #Prints 8.3 (1 + 5 + 2.3)
You may also check:How to resolve the algorithm Repeat a string step by step in the Burlesque programming language
You may also check:How to resolve the algorithm Odd word problem step by step in the CoffeeScript programming language
You may also check:How to resolve the algorithm GUI/Maximum window dimensions step by step in the Wren programming language
You may also check:How to resolve the algorithm Almkvist-Giullera formula for pi step by step in the J programming language
You may also check:How to resolve the algorithm Sum of a series step by step in the Java programming language