An algorithm is described in example 1.4 for searching a file with n entries on a CRCW SM SIMD computer. The n entries are not necessarily distinct or sorted in any order. The algorithm uses a...

An algorithm is described in example 1.4 for searching a file with n entries on a CRCW SM SIMD computer. The n entries are not necessarily distinct or sorted in any order. The algorithm uses a location F in shared memory to determine whether early termination is possible. Give a formal description of this algorithm.