1. Sorting Quiz questions
ITCS4145/5145, Parallel Programming March 19, 2013.

2. What is the sequential time complexity of Odd-Even Transposition Sort with N numbers
O(log n)
O(n)
O(n2)
O(n3)
None of the other answers

3. What is the parallel time complexity of Odd-Even Transposition Sort with N numbers and N processors
O(log n)
O(n)
O(n2)
O(n3)
None of the other answers

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: