Slide #1.

Sorting Quiz questions ITCS4145/5145, Parallel Programming March 19, 2013.
More slides like this


Slide #2.

What is the sequential time complexity of Odd-Even Transposition Sort with N numbers a) O(log n) b) O(n) c) O(n2) d) O(n3) e) None of the other answers
More slides like this


Slide #3.

What is the parallel time complexity of Odd-Even Transposition Sort with N numbers and N processors a) O(log n) b) O(n) c) O(n2) d) O(n3) e) None of the other answers
More slides like this


Slide #4.

What is the parallel time complexity of Odd-Even Transposition Sort with N numbers and P processors where each processor handles N/P numbers in the compare and exchange operation Answer:
More slides like this