https://github.com/thomwiggers/factorial

Compute factorials in Rust
https://github.com/thomwiggers/factorial

Last synced: about 6 hours ago
JSON representation

Compute factorials in Rust

• Host: GitHub
• URL: https://github.com/thomwiggers/factorial
• Owner: thomwiggers
• Created: 2018-07-04T09:28:07.000Z (over 6 years ago)
• Default Branch: main
• Last Pushed: 2023-11-23T11:07:46.000Z (12 months ago)
• Last Synced: 2024-04-24T14:58:36.685Z (7 months ago)
• Language: Rust
• Homepage:
• Size: 46.9 KB
• Stars: 10
• Watchers: 4
• Forks: 4
• Open Issues: 1
• Metadata Files:
  • Readme: README.md
  • Changelog: CHANGELOG.md

Awesome Lists containing this project

README

        
# Compute factorials

This crate provides some convenient and safe methods to compute the factorial

with an efficient method. More precisely it uses the prime swing algorithm to

compute the factorial. See [this paper](https://oeis.org/A000142/a000142.pdf)

for more detail.

It can compute the factorial in `O(n (log n loglog n)^2)` operations of

multiplication. The time complexity of this algorithm depends on the time

complexity of the multiplication algorithm used.