Describe an EREW PRAM algorithm to find an item in an array of length n in O(log n) time. If the item appears more than once in the array, then the algorithm should return the lowest index of the location.
Describe an EREW PRAM algorithm to find an item in an array of length n in O(log n) time. If the item appears more than once in the array, then the algorithm should return the lowest index of the location.