Assuming you understand how to write a recursive function, you need to establish what the base case is for this problem - when a parameter for the current term passed in is equal to the upper limit (10 in this case, but best also passed as a parameter for flexibility of use). Rather than the usual decreasing value passed in (the 10-1 version), your current term will be 1 in the first call, 2 in the next, and so on.

Val

according to me the code can be writen in this way.

It can be written that way, but it's not correct. It doesn't even compile.

Once you fix the two problems in your preprocessor directives, you'll find it is not a correct solution.

Once you've corrected the problem in main that causes you to not even see the answer your sum( ) function returns, note that you have not solved the original problem. Your function works in the 10 9 8... direction.

Your if( a ) is clever approach, however it leaves your function with a warning of "not all control paths are followed."

You should test code before posting it to the world.

>it should be 1+2+...+9+10 and not 10+9+...+2+1

But it gives you exactly the same answer, and all you are asking for is the end total right?

Sometimes the journey is more important than the destination?

Val

The quest here is not to get the result, but to get that scenario. If you just wanted to get the sum then this is suffice :
But we want to get the result such that it calculates from 1 till the limit.
We want that scenario with recursion. I've trying to figure it out, but I can't

You don't need to figure it out as it isn't your homework.

The end total can be found easily by calculating from 10+9+...+2+1 but i am more interested in the scenario as one of my friends has already said..ie. I need it to process from 1 to n and not n to 1.

ChaseVoid's code gives a good implementation of the normal (1+2+3...) method of recursively solving this problem. Reread my first comments, and you should be able to modify that function to make it solve in the desired way.

Val