递归-C-二分查找+排序

package f_recursion.C_binarySearch;


/**
 * 递归：二分查找+排序
 * 
 * @author Administrator
 * 
 */
public class BinarySearchApp {
public static void main(String[] args) {
int maxSize = 100;
ordArray arr = new ordArray(maxSize);


arr.insert(72);
arr.insert(62);
arr.insert(90);
arr.insert(45);
arr.insert(65);
arr.insert(76);
arr.insert(78);
arr.insert(23);
arr.insert(45);
arr.insert(56);
arr.insert(67);
arr.insert(456345);
arr.insert(54645);
arr.insert(146);
arr.insert(54465);


arr.display();


int searchKey = 45;
if (arr.find(searchKey) != arr.size())
System.out.println(searchKey);
else {
System.out.println("找不到");
}
}
}package f_recursion.C_binarySearch;


public class ordArray {
private long[] a;
private int nElems;


public ordArray(int max) {
a = new long[max];
nElems = 0;
}


public int size() {
return nElems;
}


public int find(long searchKey) {
return recFind(searchKey, 0, nElems - 1);
}


private int recFind(long searchKey, int lowerBound, int upperBound) {
int curIn;
curIn = (lowerBound + upperBound) / 2;
if (a[curIn] == searchKey)
return curIn;
else if (lowerBound > upperBound)
return nElems;
else {
if (a[curIn] < searchKey)
return recFind(searchKey, curIn + 1, upperBound);
else
return recFind(searchKey, lowerBound, curIn - 1);
}
}


public void insert(long value) {
int j;
for (j = 0; j < nElems; j++) {
if (a[j] > value)
break;
}
for (int k = nElems; k > j; k--) {
a[k] = a[k - 1];
}
a[j] = value;
nElems++;
}


public void display() {
for (int j = 0; j < nElems; j++) {
System.out.print(a[j] + " ");
}
System.out.println();
}
}