Find the Greatest Common Divisor between Two Numbers

main.go

package main

import "fmt"

//FindGCD - finds the greatest common divisor between two numbers
func FindGCD(a, b int) (gcd int) {
	var list []int
	for i := 1; i <= smallestNumber(a, b); i++ {
		if a%i == 0 && b%i == 0 {
			list = append(list, i)
		}
	}
	//return the last element in the slice
	return list[len(list)-1]

}

func smallestNumber(a, b int) (c int) {
	if a < b {
		return a
	}
	return b
}

func main(){
  firstNum := 63
  secondNum := 35
  greatestFactor := FindGCD(firstNum , secondNum)
  fmt.Println(greatestFactor)
}