递归算法(JAVA)

/**
 * 
 */
package algorithm;

import java.util.ArrayList;
import java.util.List;

/**
 * @author litao
 * @date 创建时间：2017年8月27日 下午2:36:17
 * @version 1.0
 * 递归算法
 */
public class MultiplicationTable {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		System.out.println("-------------------");
		MultiplicationPrint();
		System.out.println("-------------------");
		MultiplicationPrint2();
		System.out.println("-------------------");
		MultiplicationPrint3();
		System.out.println("-------------------");
		MultiplicationPrint4();
	}
	/**
	 * 递归算法一
	 */
	public static void MultiplicationPrint(){
		for(int i = 1; i < 10; i++){
			for(int j = 1; j <= i; j++){
				System.out.print(j + "*" + i +"=" + i * j + "\t\t");
			}
			System.out.println();
		}
	}
	/**
	 * 递归算法二
	 */
	public static void MultiplicationPrint2(){
		for(int i = 1; i < 10; i++){
			for(int j = i; j < 10; j++){
				System.out.print(j + "*" + i +"=" + i * j + "\t\t");
			}
			System.out.println();
		}
	}
	/**
	 * 递归算法三，排序
	 */
	public static void MultiplicationPrint3(){
		List<Integer> list = new ArrayList<>();
		list.add(2);
		list.add(1);
		list.add(3);
		list.add(6);
		list.add(0);
		System.out.print("init data:");
		for(int i = 0; i < list.size(); i++){
			System.out.print(list.get(i) + ",");
		}
		System.out.println();
		int tmp;
		for(int i = 0; i < list.size(); i++){
			for(int j = 0; j <= i; j++){
				if(list.get(i) > list.get(j)){
					tmp = list.get(i);
					list.set(i, list.get(j));
					list.set(j, tmp);
				}
			}			
		}
		System.out.print("sorted data:");
		for(int i = 0; i < list.size(); i++){
			System.out.print(list.get(i) + ",");
		}
		System.out.println();
	}
	/**
	 * 递归算法司，排序
	 */
	public static void MultiplicationPrint4(){
		List<Integer> list = new ArrayList<>();
		list.add(2);
		list.add(1);
		list.add(3);
		list.add(6);
		list.add(0);
		System.out.print("init data:");
		for(int i = 0; i < list.size(); i++){
			System.out.print(list.get(i) + ",");
		}
		System.out.println();
		int tmp;
		for(int i = 0; i < list.size(); i++){
			for(int j = i; j < list.size(); j++){
				if(list.get(i) > list.get(j)){
					tmp = list.get(i);
					list.set(i, list.get(j));
					list.set(j, tmp);
				}
			}			
		}
		System.out.print("sorted data:");
		for(int i = 0; i < list.size(); i++){
			System.out.print(list.get(i) + ",");
		}
		System.out.println();
	}
}

控制台输出：

-------------------
1*1=1
1*2=2 2*2=4
1*3=3 2*3=6 3*3=9
1*4=4 2*4=8 3*4=12 4*4=16
1*5=5 2*5=10 3*5=15 4*5=20 5*5=25
1*6=6 2*6=12 3*6=18 4*6=24 5*6=30 6*6=36
1*7=7 2*7=14 3*7=21 4*7=28 5*7=35 6*7=42 7*7=49
1*8=8 2*8=16 3*8=24 4*8=32 5*8=40 6*8=48 7*8=56 8*8=64
1*9=9 2*9=18 3*9=27 4*9=36 5*9=45 6*9=54 7*9=63 8*9=72 9*9=81
-------------------
1*1=1 2*1=2 3*1=3 4*1=4 5*1=5 6*1=6 7*1=7 8*1=8 9*1=9
2*2=4 3*2=6 4*2=8 5*2=10 6*2=12 7*2=14 8*2=16 9*2=18
3*3=9 4*3=12 5*3=15 6*3=18 7*3=21 8*3=24 9*3=27
4*4=16 5*4=20 6*4=24 7*4=28 8*4=32 9*4=36
5*5=25 6*5=30 7*5=35 8*5=40 9*5=45
6*6=36 7*6=42 8*6=48 9*6=54
7*7=49 8*7=56 9*7=63
8*8=64 9*8=72
9*9=81
-------------------
init data:2,1,3,6,0,
sorted data:6,3,2,1,0,
-------------------
init data:2,1,3,6,0,
sorted data:0,1,2,3,6,