Computer Sciences > GATE 2015 SET-1 > Analysis of Algorithms

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

Consider the following C function.

Which one of the following most closely approximates the return value of the function fun1?

A

n³

B

n(log n)²

C

n log n

D

n log(log n)

Check Answer

Explanation

Correct : d

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?

Question #23 Medium

Which operations on a binary search tree have O(h) complexity?

Question #31 Easy

Compare search complexities of sorted array vs balanced BST.

Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science