(36) What is the runtime overhead of a divide-and-conquer algorithm that recursively processes two equal halves of a problem that each have an overhead of O(n)?
(A)O(n log n)
(B)O(log n)
(C)O(n²)
(D)O(n³)
(E)O(n)

相關試題

相關試卷