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 defined 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
- Spring '08
- Unkown
- Algorithms, Computational complexity theory, Complex number, Vector Motors
-
Click to edit the document details