UK: +44 748 007-0908, USA: +1 917 810-5386 [email protected]

EREW PRAM algorithm

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.

Ready to Score Higher Grades?