samedi 15 novembre 2014

Number pyramid,beginner recursion tracking difficulty?


Vote count:

0




I am a beginner in JAVA, and I am having some difficulties tracking recursion and understaning it fully and so here I have the code for a program that if we write 3, it will output: 1

12

123

12

1

Or if we write 5, it will output

1

12

123

1234

12345

1234

123

12

1



public class Aufgabe3 {

private static void printSequenz(int n) {
if(n<1){
return;
} printLoToHi(n-1);
printMany(n);
printHiToLo(n-1);
}
private static void printHiToLo(int n){
if(n<1){
return;
}

printMany(n);
printHiToLo(n-1);
}
private static void printLoToHi(int n){
if(n<1){
return;
}
printLoToHi(n-1);
printMany(n);
}
private static void printMany(int n){
for(int i=1;i<=n;i++){
System.out.print(i);
}
System.out.println();
}

public static void main(String[] args) {
printSequenz(5);
}

}


Now here is what I don't understand. For example at the method printHiToLo it calls the method printMany(n), and then it calls itself for n-1, and this repeats until n is greater than 0. But I don't understand how the method printLoToHi works? How does it ever reach the printMany method? If it just calls itself until n is greater than 0. This is really confusing to me... Thanks to anyone that helps me out :)



asked 30 secs ago







Number pyramid,beginner recursion tracking difficulty?

Aucun commentaire:

Enregistrer un commentaire