KOMBINATOR-Y UNTUK MELAKUKAN MEMOIZING FUNGSI REKURSIFJournal: Comtech (Vol.3, No. 1)
Publication Date: 2012-06-29
Authors : Subandijo;
Page : 686-694
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.
Other Latest Articles
Last modified: 2015-11-17 15:49:07