Address Determination for Next Entry in a Binary Search Mechanism
Original Publication Date: 1980-Mar-01
Included in the Prior Art Database: 2005-Feb-13
Normally, microprocessors having a primitive instruction set do not efficiently perform a binary search. This is because such an instruction set requires multiple instructions to accomplish what could be accomplished with a single complex instruction. Hence, there is a need to solve this performance problem, and yet without resorting to complex instructions.