1.

Which is better computing time (in analysis of algorithm)?

A. O(N)
B. O(2N)
C. O(log2 N)
D. O(N log2 N)
Answer» D. O(N log2 N)


Discussion

No Comment Found