Individual digits sum with flowchart and algorithm?

Answer 1

Well, it's very hard to write a flowchart in text, so I'll give you some pseudo code instead.

int number = the given number

int sum = 0

loop while number is not 0

sum = sum + (number mod 10)

number = number / 10

Answer 2

#include
#include
void main()
{
int n,sum,r;
clrscr();
printf("Enter an Integer: ");
scanf("%d",&n);
sum=0;
while(n>0)
{
r=n%10;
sum=sum+r;
n=n/10;
}
printf("Sum of Digits: %d",sum);
getch();
}

output:
Enter an Integer:
1234
Sum of Digits: 10




1. Start the program.
2. Input n.
3. Initialize as sum=0;
4.using while loop test condition as (n>0)
5. If this derives to true then next move to body of the loop.
6. body of the loop.
7. Process as follows
i. Store the remainder in r by Modulo Division the given number by 10.
r=n%10;
ii. Add the remainder to the summation
sum=sum+r;
iii. Again divide the n by 10 and store the value in n.
n=n/10;
8. Again the loop tests for n>0
9. When n becomes less than 0 the loop terminates
10. Finally the out put prints the sum of digits of a given integer

Answer 3

sum of individual digit of a positive integer

Answer 4

the sum of individual digits of a given integer number

Answer 5

draw a flow chart to arange the given data in ascending order

Answer 6

2