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

_________ is token ring.
Consider the following two statements. S1: Destination MAC address of an ARP request is a broadcast address. S2: Destination MAC address of an ARP reply ...
An ADT defines:
Which error correction technique is capable of correcting single-bit errors and detecting two-bit errors?
What is the main purpose of a parser in a compiler?
What is the main objective of cluster analysis in data analytics?
Which of the following is a measure of a diode's ability to conduct current in the forward direction?
In the _____ traversal we process all of the vertex descendant before we move to an adjacent vertex.
Which of the following backup types provides the fastest backup and recovery performance but requires the most storage space?
Which network layer protocol provides a reliable, connection-oriented delivery of packets?

Hey! Ask a query

ask-question