This preview shows page 1. Sign up to view the full content.
Unformatted text preview: of the computation. (The number of processors should be bounded by a polynomial in n .) 3. The vector V and W is deﬁned like below. V = { v 1 ,v 2 , ··· ,v n } W = { w 1 ,w 2 , ··· ,w n } We can say that the V is stronger than W , if the number of elements in V such that v i ≥ w i , (1 ≤ i ≤ n ) is more than b n/ 2 c . Using n processors, design the algorithm that determines which vector is stronger. Then analyze the complexity of your algorithm. 1...
View
Full
Document
This note was uploaded on 02/04/2010 for the course COMPUTER S cs300 taught by Professor Unkown during the Spring '08 term at Korea Advanced Institute of Science and Technology.
 Spring '08
 Unkown
 Algorithms

Click to edit the document details