public boolean shortSearch(int v) {
		p = root;

		if (p == null)
			return false;

		while (p != null) {
			int i;
			for (i = 1; i <= p.numOfElements; i++) {
				// ҵԪ
				if (p.value[i] == v) {

					// Message.EndSearch();
					return true;
				}
				if (p.value[i] > v)
					break;
			}
			// p½ʵλ
			if (i <= p.numOfElements)
				p = p.children[i - 1];
			else
				p = p.children[p.numOfElements]; // ֹԽ

		}
		return false;
	}