递归算法

package sort;/** * 递归算法 * 三角数列: 1,3,6,10,15,21...... * @author zheng */public class Sort1 {public int data(int n){if(n<=1)return 1;return n+data(n-1);}public static void main(String[] args) {System.out.println(new Sort1().data(7));}}/** * 递归算法 * 计算n! * @author zheng */public class Sort2 {public int data(int n){if(n==1)return 1;return n*data(n-1);}public static void main(String[] args) {System.out.println(new Sort2().data(3));}}