Java中的冒泡排序跟折半查找

private static int halfSearch(int[] originArray, int key) {
		int leftPos = 0;
		int rightPos = originArray.length - 1;
		int mid = (leftPos + rightPos) >> 1;
		while (originArray[mid] != key) {
			if (key > originArray[mid]) {
				leftPos = mid + 1;
			} else {
				rightPos = mid - 1;
			}
			if (rightPos < leftPos) {
				return -1;
			}
			mid = (leftPos + rightPos) >> 1;
		}
		return mid;
	}

	public int[] bubble(int[] originArray) {
		for (int i = 0; i < originArray.length - 1; i++) {
			for (int j = 0; j < originArray.length - i - 1; j++) {
				if (originArray[j] > originArray[j + 1]) {
					int temp = originArray[j + 1];
					originArray[j + 1] = originArray[j];
					originArray[j] = temp;
				}
			}
		}
		return originArray;
	}