package Algoexam;
public class Gugudan {
public static void main(String[] args) {
//guguexam();
//recursiononefor(0);
//recursiononefor1(0);
//recursitwofor(0 , 0);
//recursitwofor2(0);
recursiontwoforgugu(0,0);
}
public static void guguexam(){
for(int i =0 ; i<10 ; i++){
for (int j=0; j<10 ; j++){
System.out.println(i+"*"+j+"="+i*j);
}
}
}
public static void recursiononefor(int i ){
if(i==10){
return ;
}
System.out.println(i);
recursiononefor(i+1);
}
public static void recursiononefor1(int i){
if(i==10){
return;
}
i++;
System.out.println(i);
recursiononefor1(i);
}
public static void recursitwofor(int i , int j){
if(i==10){
return ;
}
System.out.println(i+"*"+j);
recursitwofor(i+1 , j);
}
public static void recursitwofor2(int i ){
if(i==10){
return ;
}
recursitwofor2(i+1 );
System.out.println(i);
}
public static void recursiontwoforgugu(int i , int j){
if(i<10){
System.out.println(i+"*"+j+"="+i*j);
if(j<9){
recursiontwoforgugu(i, j+1);
}else{
recursiontwoforgugu(i+1, 1);//(i+1, j) 해서 에러
}
}
else{
return;
}
}
}
'재귀' 카테고리의 다른 글
| 재귀 함수 로 n까지의 합 구하기 (0) | 2015.05.27 |
|---|
