Algorithms · Question 9 · Medium
What does the following function return for f(4096)?
int f(int n) {
if (n == 0)
return 0;
return n % 10 + f(n / 10);
}- 4096
- 4
- 19
- 22
Answer and explanation
Answer: C. 19
Explanation: The function adds the last digit and recurses on n / 10, so it returns the digit sum: 4 + 0 + 9 + 6 = 19.
Previous: Quick sort always picks the last element as the pivot. For which input does it… · Next: Coins of value ₹1, ₹3 and ₹4 are available in unlimited supply. A greedy…
Practise algorithms
Try a fresh set of algorithms questions with an explanation after every answer, free and without signing up: Algorithms practice. Or sit a full placement mock test.
More algorithms questions
- What is the solution of the recurrence T(n) = 2T(n/2) + n, with T(1) = 1?
- What is the maximum number of swaps selection sort performs on an array of n…
- Quick sort always picks the last element as the pivot. For which input does it…
- Coins of value ₹1, ₹3 and ₹4 are available in unlimited supply. A greedy…
- Insertion sort is applied to [5, 2, 4, 6, 1, 3]. What does the array look like…
- What is the length of the Longest Common Subsequence (LCS) of the strings…
- A 0/1 knapsack has capacity 7 kg. The items (weight, value) are: (1 kg, ₹1)…
- For the naive recursive Fibonacci function below, how many times is fib called…
- Using the Master theorem, what is the solution of T(n) = 3T(n/2) + n?
- What is the best-case time complexity of linear search on an array of n…
More technical & programming practice
Object-Oriented Programming · DBMS · SQL · Operating Systems · Computer Networks · Software Engineering · Cloud & DevOps · GenAI Basics
LogicWiz Exams home · All practice topics · Placement mock tests · Daily 10 challenge