1. Rewrite the compare-and-exchange code given in Section 10.2.1 to eliminate the messagepassing when exchanges are not needed. 2. Determine the processor efficiency of the Ο(log n) algorithm based...

1. Rewrite the compare-and-exchange code given in Section 10.2.1 to eliminate the messagepassing when exchanges are not needed.

2. Determine the processor efficiency of the Ο(log n) algorithm based upon the rank sort described in Section 10.1.3 for sorting numbers.