|
This article is cited in 1 scientific paper (total in 1 paper)
An Improved Computational Algorithm for Finding the Factorial
A. V. Ladikov Moscow State University of Railway Communications
Abstract:
In the present paper, we consider a method for improving the computational algorithm for finding the factorials of integers; this method linearly accelerates the computations. We also present several algorithms effectively realizing this method and analyze their complexity.
Keywords:
computational algorithm, factorial, algorithm complexity.
Received: 21.11.2006
Citation:
A. V. Ladikov, “An Improved Computational Algorithm for Finding the Factorial”, Mat. Zametki, 83:6 (2008), 857–863; Math. Notes, 83:6 (2008), 783–789
Linking options:
https://www.mathnet.ru/eng/mzm4837https://doi.org/10.4213/mzm4837 https://www.mathnet.ru/eng/mzm/v83/i6/p857
|
Statistics & downloads: |
Abstract page: | 2218 | Full-text PDF : | 1703 | References: | 72 | First page: | 85 |
|