Skip to content

feat: add a recursive implementation of syracuse conjecture #2

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

feat: add a recursive implementation of syracuse conjecture #2

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
16 changes: 16 additions & 0 deletions go100/09-exercices/correction/main.go
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,22 @@ package main

import "fmt"

func realSyracuse(val, currentItern, maxIter int) (bool, int) {
if val == 1 {
return true, currentItern
} else if currentItern >= maxIter {
return false, currentItern
} else if val % 2 == 0 {
return realSyracuse(val / 2, currentItern+1, maxIter)
} else {
return realSyracuse(3*val + 1, currentItern+1, maxIter)
}
}

func recursiveSyracuse(val, nbMaxIteration int) (bool, int) {
return realSyracuse(val, 0, nbMaxIteration)
}

//syracuse prend en paramètre un entier et un nombre max d'itérations à effectuer.
//Elle retourne un booléen indiquant si le nombre 1 a été atteint, suivi du nombre d'itérations qui ont été effectuées.
func syracuse(start int, maxIterations int) (bool, int) {
Expand Down