1.

What is the total time spent for N-1 merges in a dynamic equivalence problem?

A. O(N)
B. O(log N)
C. O(N log N)
D. O(M log N)
Answer» D. O(M log N)


Discussion

No Comment Found