Statistica
All
RANK
12.732
of 301.540
REPUTAZIONE
4
CONTRIBUTI
0 Domande
2 Risposte
ACCETTAZIONE DELLE RISPOSTE
0.00%
VOTI RICEVUTI
1
RANK
2.912 of 21.319
REPUTAZIONE
574
VALUTAZIONE MEDIA
5.00
CONTRIBUTI
10 File
DOWNLOAD
17
ALL TIME DOWNLOAD
5027
CONTRIBUTI
0 Post
CONTRIBUTI
1 Pubblico Canale
VALUTAZIONE MEDIA
50
CONTRIBUTI
0 Punti principali
NUMERO MEDIO DI LIKE
Feeds
Risposto
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));%...
oltre 5 anni fa | 0
Risposto
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...
oltre 5 anni fa | 1
