Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,959 questions

51,901 answers

573 users

How to calculate the GCD (greatest common divisor) of two numbers in Go

1 Answer

0 votes
package main

import "fmt"

func gcd(a, b int) int {
	gcd := 0
	i := a
	if b < a {
		i = b
	}

	for i > 0 {
		if a%i == 0 && b%i == 0 {
			gcd = i
			break
		}
		i--
	}

	return gcd
}

func main() {
	a := 12
	b := 20

	fmt.Printf("The GCD (greatest common divisor) of %d and %d is: %d\n", a, b, gcd(a, b))
}


/*
run:

The GCD (greatest common divisor) of 12 and 20 is: 4

*/

 



answered Sep 4, 2024 by avibootz
...