binary_gcd

An efficient Elixir implementation of the binary GCD algorithm (Stein's algorithm) for computing the greatest common divisor (GCD) of two or more non-negative integers using only bitwise operations and subtraction.

zacky1972
Algorithms and Data structures

Package Resources

binary_gcd
No Github
Documentation
No Changelog

Stars

-

Unreleased Activity

-

First Release

4

months ago

Last Release

4

months ago

Downloads

1.8k

last 90 days

Last Stable Version

1.1.0

Activity

No Github Activity

Version 1.1.0

Published Jul 2025 •
Elixir Version Requirement ~> 1.14
Documentation for 1.1.0

Dependencies

1
nstandard ~> 0.1

A standard library setup based on the Nerves project standard practices.

No changelog for 1.1.0
Inspect source for 1.1.0

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

79 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

2.17.1

Raft library

flow

1.2.4

Computational parallel flows for Elixir