CRCW PRAM algorithm Given a set of integers between 1 and n, design a CRCW PRAM algorithm to decide whether there any integers repeated in the set. Full marks will be given for a correct O(1) time algorithm using n processors.
