Statistics
All
RANK
12,742
of 300,746
REPUTATION
4
CONTRIBUTIONS
0 Questions
2 Answers
ANSWER ACCEPTANCE
0.00%
VOTES RECEIVED
1
RANK
2,924 of 21,069
REPUTATION
566
AVERAGE RATING
5.00
CONTRIBUTIONS
10 Files
DOWNLOADS
32
ALL TIME DOWNLOADS
4951
CONTRIBUTIONS
0 Posts
CONTRIBUTIONS
1 Public Channel
AVERAGE RATING
50
CONTRIBUTIONS
0 Discussions
AVERAGE NO. OF LIKES
Feeds
Answered
I want to write a recursive Function that can calculate the sum of all the digit. If the input is 12345 then the answer will be 1+2+3+4+5 , without using string2num and loop.
You can do this with any inbuit functions. function x = digit_sum(n) x=0; if n>0 x=mod(n,10)+digit_sum(floor(n./10));%...
I want to write a recursive Function that can calculate the sum of all the digit. If the input is 12345 then the answer will be 1+2+3+4+5 , without using string2num and loop.
You can do this with any inbuit functions. function x = digit_sum(n) x=0; if n>0 x=mod(n,10)+digit_sum(floor(n./10));%...
5 years ago | 0
Answered
Create a program that asks a user to input a number and then finds the sum of digits of the number using recursion. for example 341 = 3+4+1 = 8
% This program does not require any inbuilt functions. function x = digit_sum(n) x=0; if n>0 x=mod(n,10)+digit_sum(floor...
Create a program that asks a user to input a number and then finds the sum of digits of the number using recursion. for example 341 = 3+4+1 = 8
% This program does not require any inbuilt functions. function x = digit_sum(n) x=0; if n>0 x=mod(n,10)+digit_sum(floor...
5 years ago | 1
