基础算法

1、递归 n!

public class RecursionNum {
	
	public int getNum(int i){
		if(i==1){
			return 1;
		}else{
			return i*getNum(i-1);
		}
	}
	
	public static void main(String[] args){
		RecursionNum rn = new RecursionNum();
		System.out.println(rn.getNum(10));
	}

}

2、冒泡 排序

public class BubbleSort {
	
	public int[] getNumByAsc(int[] intArray){
		int temp ;
		if(null!=intArray){
			for(int i=0;i<intArray.length;i++){
				for(int j=i;j<intArray.length;j++){
					if(intArray[i]>intArray[j]){
						temp = intArray[i];
						intArray[i] = intArray[j];
						intArray[j] = temp;
					}
				}
			}
		}
		return intArray;
	}
	
	public static void main(String[] args){
		BubbleSort bs = new BubbleSort();
		int[] intArray = {5,9,3,4,8,1,6,7,2,0};
		int[] returnArray = bs.getNumByAsc(intArray);
		for(int i=0;i<returnArray.length;i++){
			System.out.print(returnArray[i]);
		}
	}

}