该文档简单介绍了递归的定义,以及用递归实现久久乘法表的打印。
import java.io.*;
/**
* @author 张云涛
* @description 打印9*9乘法表
*
*/
public class Tabale99 {
/**
* @param args
* @return void
*
*/
public static void main(String args[])
{
/***************************************************************/
//用for循环打印9*9乘法表
System.out.println("=========9*9乘法表(for循环打印)==========");
for(int i=1;i<10;i++)
{
for(int j=1;j<=i;j++)
{
System.out.print(j+" * "+i+" = "+j*i); //打印
System.out.print("\t"); //空格
}
System.out.println();
}
/*************************************************************/
//用递归打印9*9乘法表
System.out.println("=========9*9乘法表(递归打印)==========");
method(9);
}
//递归方法
public static void method(int i)
{
if (i == 1)
{
System.out.print("1 * 1 = 1\t\n");
}else
{
method(i - 1);
for (int j = 1; j <= i; j++)
{
System.out.print(j + " * " + i + " = " + j * i + "\t");
}
System.out.println();
}
}
}
/*********************************************************/
//以下是运行的结果
/**
=========9*9乘法表(for循环打印)==========
1 * 1 = 1
1 * 2 = 22 * 2 = 4
1 * 3 = 32 * 3 = 63 * 3 = 9
1 * 4 = 42 * 4 = 83 * 4 = 124 * 4 = 16
1 * 5 = 52 * 5 = 103 * 5 = 154 * 5 = 205 * 5 = 25
1 * 6 = 62 * 6 = 123 * 6 = 184 * 6 = 245 * 6 = 306 * 6 = 36
1 * 7 = 72 * 7 = 143 * 7 = 214 * 7 = 285 * 7 = 356 * 7 = 427 * 7 = 49
1 * 8 = 82 * 8 = 163 * 8 = 244 * 8 = 325 * 8 = 406 * 8 = 487 * 8 = 568 * 8 = 64
1 * 9 = 92 * 9 = 183 * 9 = 274 * 9 = 365 * 9 = 456 * 9 = 547 * 9 = 638 * 9 = 729 * 9 = 81
=========9*9乘法表(递归打印)==========
1 * 1 = 1
1 * 2 = 22 * 2 = 4
1 * 3 = 32 * 3 = 63 * 3 = 9
1 * 4 = 42 * 4 = 83 * 4 = 124 * 4 = 16
1 * 5 = 52 * 5 = 103 * 5 = 154 * 5 = 205 * 5 = 25
1 * 6 = 62 * 6 = 123 * 6 = 184 * 6 = 245 * 6 = 306 * 6 = 36
1 * 7 = 72 * 7 = 143 * 7 = 214 * 7 = 285 * 7 = 356 * 7 = 427 * 7 = 49
1 * 8 = 82 * 8 = 163 * 8 = 244 * 8 = 325 * 8 = 406 * 8 = 487 * 8 = 568 * 8 = 64
1 * 9 = 92 * 9 = 183 * 9 = 274 * 9 = 365 * 9 = 456 * 9 = 547 * 9 = 638 * 9 = 729 * 9 = 81
递归做为一种算法在程序设计语言中广泛应用。是指函数/过程/子程序在运行过程中直接或间接调用自身而产生的重入现象。
递归是计算机科学的一个重要概念,递归的方法是程序设计中有效的
方法,采用递归编写程序能使程序变得简洁和清晰。。
递归算法解题相对常用的算法如普通循环等,运行效率较低。因此,应该尽量避免使用递归,除非没有更好的算法或者某种
特定情况,递归更为适合的时候。在递归调用的过程当中系统为每一层的返回点、局部量等开辟了栈来存储。递归次数过多容易造成栈溢