GitHub / darian-catalin-cucer / euclidean-algorithm
Euclidean Algorithm is an efficient algorithm for finding the greatest common divisor (GCD) of two numbers. It repeatedly computes the remainder of the larger number divided by the smaller number until the remainder is zero, at which point the smaller number is the GCD.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/darian-catalin-cucer%2Feuclidean-algorithm
PURL: pkg:github/darian-catalin-cucer/euclidean-algorithm
Stars: 2
Forks: 0
Open issues: 0
License: None
Language: Kotlin
Size: 1000 Bytes
Dependencies parsed at: Pending
Created at: over 2 years ago
Updated at: over 2 years ago
Pushed at: over 2 years ago
Last synced at: over 2 years ago
Topics: android, euclidean-algorithm, euclidean-distance, java, kotlin, mobile