Question
calculate the complexity of the below recursive code Int f(int
calculate the complexity of the below recursive code Int f(int
n) { If(n return 1; return f(n/2)+f(n/2); }
More IT Networking Questions
- Which of the following is the most effective countermeasure for Phishing?
- What is the primary role of the "View" in the MVC architecture?
- State true/false Trojans can sometimes acts in favour of ransomware and ask for ransom.
- In dynamic programming, what is the purpose of the "bottom-up" approach?
- Which of the following is a correct example pairing of a cloud service model with a representative real-world service?
- Which algorithmic design technique involves breaking down a problem into smaller subproblems and solving them recursively?
- CSS comments are placed within the ______.
- What is the purpose of encryption in cybersecurity?
- ICMP sends “Destination Unreachable – Fragmentation Needed” when:
- What is the scope of a parameter in a function?
Hey! Ask a query
Please enter email id
The email must be a valid email address.
Please enter Mobile Number
Please enter valid Mobile Number
Please enter your Doubt
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
- 200 Questions with Detailed Solutions
- Section-wise Coverage (GA, English, Quant & Reasoning)