lehmer_gcd

An efficient implementation of the Lehmer GCD algorithm for computing the greatest common divisor of large integers in Elixir.

Algorithms and Data structures

Package Resources

lehmer_gcd
zacky1972/lehmer_gcd
Documentation
Changelog

Stars

1

Unreleased Activity

Unknown

First Release

9

months ago

Last Release

9

months ago

Downloads

67

last 90 days

Last Stable Version

1.0.2

Activity

last year

Pull Requests

Open 0
Merged 0

Latest Merged Pull Requests

No Github activity

Issues

Open 0
Closed 0

Version 1.0.2

Failed to load version 1.0.2 information.

Please refresh in a bit

Community

Looks like this space is still empty… Want to be the first to contribute?

Share an article, talk, or podcast by adding resources to this package.

Related Packages

91 packages

jumper

1.0.2

Jump consistent hash implementation in Elixir

ex_hash_ring

7.0.0

A fast consistent hash ring implementation in Elixir.

ra

3.1.5

Raft library

flow

1.2.4

Computational parallel flows for Elixir