Kombinator-Y untuk Melakukan Memoizing Fungsi Rekursif
DOI:
https://doi.org/10.21512/comtech.v3i1.2468Keywords:
memorizing, recursive function, fixed-point, Y combinator, javascriptAbstract
This article discusses how to find a solution of a recursive function such as Fibonacci or factorial numbers without repetition. Therefore, a recursive function is considered a fixed-point of non-recursive function. To calculate the fixed-point, we can use Y Combinator, a non-recursive functions to perform memoizing recursive function. This method can significantly reduce the execution time of recursive functions.
Plum Analytics
References
Hoffman, B. (1992). "Term Rewriting with Sharing and Memoïzation," Algebraic and Logic Programming: Third International Conference, Proceedings, H. Kirchner and G. Levi (eds.), 128–142, Italy.
Michie, D. (1968). Memo Functions and Machine Learning. Nature, 218, 19–22.
Nash, Trey. (2007) Accelerated C# 2008. Berkeley: Apress.
Shoenfield, J. R. (2004). Recursion Theory (2nd edition). Massachussets: A K Peters.
Stefanov, S. (2010). JavaScript Patterns. Stamford: O’Reilly.
Downloads
Published
Issue
Section
License
Authors who publish with this journal agree to the following terms:
a. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License - Share Alike that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
b. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
c. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
USER RIGHTS
All articles published Open Access will be immediately and permanently free for everyone to read and download. We are continuously working with our author communities to select the best choice of license options, currently being defined for this journal as follows:
