Login / Signup

Question

calculate the complexity of the below recursive code Int f(int
n) { If(n return 1; return f(n/2)+f(n/2); }

A T(n)= 2T(n/2)+O(1)

B T(n)= T(n/2)+O(1)

C T(n)= 2T(n/4)+O(1)

D T(n)= 2T(n/6)+O(1)

E none

Practice Next

More IT Networking Questions

Which of the following is the boolean expression for the XOR function?
Which component of an ER diagram represents an attribute?
Which layer of the OSI model is responsible for establishing, managing, and terminating connections between applications?
The question of whether P = NP is one of the most famous open problems in computer science. Which statement best describes this question?
Which of the following is an example of a strong password?
What does CSMA/CD stand for in the context of LAN technology?
Which property distinguishes a B+ tree from a B-tree?
You have a positive-edge-triggered D flip-flop. If the current state is Q = 0 and the D input is 1, what will be the state after the clock edge?
What is a primary objective of a System Audit in an IT environment?
When implementing a hash table, which of the following collision resolution techniques is known for its efficiency and is based on creating a linked list f...

Hey! Ask a query

ask-question