Digital Root using Recursion

You are given a number n. You need to find the digital root of n.
DigitalRoot of a number is the recursive sum of its digits until we get a single digit number.
Eg.DigitalRoot(191)=1+9+1=>11=>1+1=>2

int digitalRoot(int n)
{
    int sum = 0;
    if (n < 10)
        return n;
     
    sum = digitalRoot(n / 10) + n % 10;
 
    if (sum / 10 != 0)
    {
        return digitalRoot(sum);
    }
    else
    {
        return sum;
    }
}

Good Stuff

1. Eat Brain healthy foods:

1. Avocado
2. Blueberry
3. Broccoli
4. Coconut
5. Eggs
6. Green Vegetables
7. Salmon Fish
8. Turmeric
9. Walnut
10. Orange
11. Apple
12. Banana

2. Get Good Sleep

3. Avoid negativity

4.  Be in positive and goal driven group

5.  Always be curious, ask question - A question opens the mind , statement closes it.

6.  As Albert Einstein said , Imagination is more important than knowledge but  right
imagination will come with creativity and creativity can come after learning skills and
lots of practice.   So Acquire the skill to be able to imagine then to explore which would
eventually help acquire knowledge.

7. Win the morning , Win the day