Created
February 2, 2023 10:55
-
-
Save raimonizard/71a615a994ea0c5bc2e2d1e2187c807b to your computer and use it in GitHub Desktop.
Exemple de recursivitat per calcular una multiplicació de nombres enters naturals en java
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/** | |
* Classe d'exemple per calcular una multiplicació natural de nombres enters | |
* a base de sumes recursives | |
* @author: Raimon Izard | |
* @version: 1.0 | |
*/ | |
public class MultiplicacioRecursiva { | |
/** | |
* Mètode static main per executar la classe | |
* @param args | |
*/ | |
public static void main(String[] args) { | |
int a = 5, b = 3; | |
int resultat = sumesRecursives(a, b); | |
System.out.println(resultat); | |
} | |
/** | |
* Mètode recursiu que permet calcular la multiplicació de dos nombres enters naturals | |
* @param a Valor base (int) | |
* @param b Valor multiplicador (int) | |
* @return retorna un enter amb la multiplicació de a * b | |
*/ | |
private static int sumesRecursives(int a, int b) { | |
if (b == 0){ // Cas base | |
return 0; | |
}else{ // Cas recursiu | |
return a + sumesRecursives(a, b - 1); | |
} | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment