+2 votes
in Mathematics by kratos

The running time for creating a heap of size n is

(A) O (n)

(B) O (log n)

(C) O (n log n)

(D) O (n2 )

1 Answer

+5 votes
by kratos
 
Best answer

Correct option- (C) O (n log n)

...