What Is The Time Complexity Of The Following Recursive #1694
What is the time complexity of the following recursive implementation to find the sum of digits of a number n?</p> <pre><code class="language-c"> #include<stdio.h> int recursive_sum_of_digits(int n) { if(n == 0) return 0; return _________; } int main() { int n = 1201; int ans = recursive_sum_of_digits(n); printf("%d",ans); return 0; }</code></pre>
This multiple choice question (MCQ) is related to the book/course
gs gs122 Data Communication and Computer Network.
It can also be found in
gs gs122 Recursion - Sum of Digits of a Number using Recursion - Quiz No.1.
What is the time complexity of the following recursive implementation to find the sum of digits of a number n?
#include<stdio.h> int recursive_sum_of_digits(int n) { if(n == 0) return 0; return _________; } int main() { int n = 1201; int ans = recursive_sum_of_digits(n); printf("%d",ans); return 0; }
O(n)
O(1)
O(len(n)), where len(n) is the number of digits in n
O(1/2)
Similar question(s) are as followings:
Online Quizzes of gs122 Data Communication and Computer Network
Sorting - Insertion Sort - Quiz No.1
gs gs122 Data Communication and Computer Network
Online Quizzes
Sorting - Insertion Sort - Quiz No.2
gs gs122 Data Communication and Computer Network
Online Quizzes
Sorting - Insertion Sort - Quiz No.3
gs gs122 Data Communication and Computer Network
Online Quizzes
Sorting - LSD Radix Sort - Quiz No.1
gs gs122 Data Communication and Computer Network
Online Quizzes
Sorting - MSD Radix Sort - Quiz No.1
gs gs122 Data Communication and Computer Network
Online Quizzes
Sorting - MSD Radix Sort - Quiz No.2
gs gs122 Data Communication and Computer Network
Online Quizzes
