[Function add]

1.Test the machanism of java passing parameter.
2.Binary search.(Recursive)

Author: Seanforfun

Algorithm(4th_Edition)/algorithm_note.txt

@@ -14,4 +14,40 @@
 
 3.计算调和级数（Harmonic series）：
 	1.证明其为发散数列。
-	实现：ca.mcmaster.chapter.one.MyMath.harmonicSeries(int)
+	实现：ca.mcmaster.chapter.one.MyMath.harmonicSeries(int)
+	
+4.Java值传递：
+	class Test{
+		String name;
+		public String getName() {
+			return name;
+		}
+		public void setName(String name) {
+			this.name = name;
+		}
+	}
+	private static void call(Test t){
+		Test tnew = new Test();
+		t.setName("abc");
+		System.out.println(t);	//ca.mcmaster.chapter.one.Test@2a8b83e3
+		tnew.setName("111");
+		t = tnew;
+		System.out.println(t);	//ca.mcmaster.chapter.one.Test@2d7fc1e7
+	}
+	public static void main(String[] args) {		
+		//Java pass value test
+		Test t = new Test();
+		System.out.println(t);	//ca.mcmaster.chapter.one.Test@2a8b83e3
+		call(t);
+		System.out.println(t);	//ca.mcmaster.chapter.one.Test@2a8b83e3
+	}
+	1.基本数据类型都是值传递。
+	2.引用类型传递是引用的拷贝，既不是引用本身，更不是对象。
+		***因为java本身不存在地址，传参时相当于复制了当前地址的引用，并将复制的引用进行传递。
+		
+5. 二分法查找：
+	1.查找的数组是顺序的。
+	2.通过递归的方法不断调用，传入需要比较的上界和下界。
+	3.比较中间位置的值和查找值的大小，相同结束回归，不相同修改上界和下界。
+	实现：ca.mcmaster.chapter.one.Recursive.rank(int, int[])
+		

Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/MyMath.java

@@ -26,10 +26,35 @@ public static Double harmonicSeries(int N) {
 		}
 		return sum;
 	}
+	
+	private static void call(Test t){
+		Test tnew = new Test();
+		t.setName("abc");
+		System.out.println(t);
+		tnew.setName("111");
+		t = tnew;
+		System.out.println(t);
+	}
 
 	public static void main(String[] args) {
 		// System.out.println(isPrime(13));
 //		System.out.println(sqrt(2D));
-		System.out.println(harmonicSeries(1000));
+//		System.out.println(harmonicSeries(1000));
+		
+		//Java pass value test
+		Test t = new Test();
+		System.out.println(t);
+		call(t);
+		System.out.println(t);
+	}
+}
+
+class Test{
+	String name;
+	public String getName() {
+		return name;
+	}
+	public void setName(String name) {
+		this.name = name;
 	}
 }

Algorithm(4th_Edition)/src/ca/mcmaster/chapter/one/Recursive.java

@@ -0,0 +1,26 @@
+package ca.mcmaster.chapter.one;
+
+public class Recursive {
+	private static int rank(int key, int[] a){
+		return rank(key, a, 0, a.length - 1);
+	}
+	
+	public static int rank(int key, int[] a, int low, int hi){
+		System.out.println("low is " + low + "; high is " + hi); 
+		if(low > hi){
+			return -1;
+		}
+		int mid = low + (hi - low)/2;
+		if(key < a[mid])
+			return rank(key, a, low, mid - 1);
+		else if(key > a[mid])
+			return rank(key, a, mid + 1, hi);
+		else
+			return mid;
+	}
+	
+	public static void main(String[] args){
+		int[] a = {1, 2, 3, 4, 5, 6, 7, 8, 9};
+		System.out.println(rank(7, a));
+	}
+}