MCPcopy Create free account
hub / github.com/andeya/algorithm / GCDByte

Function GCDByte

mathutil/mathutil.go:77–82  ·  view source on GitHub ↗

GCDByte returns the greatest common divisor of a and b. Based on: http://en.wikipedia.org/wiki/Euclidean_algorithm#Implementations

(a, b byte)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 1

BenchmarkGCDByteFunction · 0.85

Calls

no outgoing calls

Tested by 1

BenchmarkGCDByteFunction · 0.68