Let's do better. You can find the largest element in a list in O(1) time with n^2 processors[0]*. Division of the list by that number is O(1) with n processor

Let's do better. You can find the largest element in a list in O(1) time with n^2 processors[0]*. Division of the list by that number is O(1) with n processors Therefore the operation is O(1) [0]* on a CRCW PRAM https://www.cpp.edu/~gsyoung/CS535/CS535Notes/Part2PRAM.pdf#page=1 https://www.cpp.edu/~gsyoung/CS535/CS535Notes/Part2PRAM.pdf#...