单选题：Which one of the following statements about the Ranking problem
Which one of the following statements about the Ranking problem is TRUE? (Assume that both arrays contain $$N$$ elements)
A.Serial ranking algorithm has the different asymptotic value of time complexity with its asymptotic value of work load.
B.Using binary search algorithm to solve the problem will make the time complexity be $$O(N\log N)$$
C.Serial ranking algorithm has the worse work load comparing with the binary search algorithm.
D.Parallel binary search algorithm will solve the problem in $$O(\log N)$$ time with $$O(N\log N)$$ work load.
答案：D
A.Serial ranking algorithm has the different asymptotic value of time complexity with its asymptotic value of work load.
B.Using binary search algorithm to solve the problem will make the time complexity be $$O(N\log N)$$
C.Serial ranking algorithm has the worse work load comparing with the binary search algorithm.
D.Parallel binary search algorithm will solve the problem in $$O(\log N)$$ time with $$O(N\log N)$$ work load.
答案：D