单选题：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 better time complexity comparing with the binary search algorithm.
B.Using binary search algorithm to solve the problem will make the time complexity be $$O(N\log N)$$
C.It can be used in merging problem and make the merging problem solved in $$O(1)$$ time.
D.Parallel binary search algorithm will solve the problem in $$O(\log N)$$ time with $$O(\log N)$$ work load.
答案：C
A.Serial ranking algorithm has better time complexity comparing with the binary search algorithm.
B.Using binary search algorithm to solve the problem will make the time complexity be $$O(N\log N)$$
C.It can be used in merging problem and make the merging problem solved in $$O(1)$$ time.
D.Parallel binary search algorithm will solve the problem in $$O(\log N)$$ time with $$O(\log N)$$ work load.
答案：C