Efficient Parallel Binary Search on Sorted Arrays, with Applications

  • Authors:

  • Danny Z. Chen

  • Affiliations:

  • -

  • Venue:
  • IEEE Transactions on Parallel and Distributed Systems
  • Year:
  • 1995

Quantified Score

Hi-index 0.01

Visualization

Abstract

Let $A$ be a sorted array of $n$ numbers and $B$ a sorted array of $m$ numbers, both in nondecreasing order, with $n \leq m$. We consider the problem of determining, for each element $A(j)$, $j$$=$$1$, $2$, $\cdots,$$n$, the unique element $B(i)$, $0 \leq i \leq m$, such that $B(i)$$\leq A(j)$$