Kombinator-Y untuk Melakukan Memoizing Fungsi Rekursif

ComTech

Subandijo Subandijo¹ 

[1] Bina Nusantara University;

关键词: memorizing, recursive function, fixed-point, Y combinator, javascript;   

DOI  :  10.21512/comtech.v3i1.2468

来源: DOAJ

【 摘 要 】

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.

【 授权许可】

Unknown