二分法快速查找的递归算法

http://www.cnblogs.com/darejoy/archive/2010/05/27/1745871.html

1. private static int find(int[] arySource, int target, int start, int end)
   
2. {
   
3.     if (start == end)
   
4.     {
   
5.         if (arySource[start] == target)
   
6.         {
   
7.             return start;
   
8.         }
   
9.         else
   
10.         {
    
11.             return -1;
    
12.         }
    
13.     }
    
14.     else if (start > end)
    
15.     {
    
16.         return -1;
    
17.     }
    
18. 
    
19.     int curIndex = -1;
    
20.     curIndex = (start + end) / 2;
    
21. 
    
22.     int middleValue = arySource[curIndex];
    
23.     if (target == middleValue)
    
24.     {
    
25.         return curIndex;
    
26.     }
    
27.     else if (target < middleValue)
    
28.     {
    
29.         return find(arySource, target, start, curIndex - 1 );
    
30.     }
    
31.     else
    
32.     {
    
33.         return find(arySource, target, curIndex + 1, end);
    
34.     }
    
35. }

转载于:https://www.cnblogs.com/black/p/5171609.html