I am trying to develop an algorith for a short program i need to
write, I will explain the program:
it is to be a non-returning function/percedure, whatever you prefer.
there is two incoming values, one is "output(some languages may not
need to pass the output, you need not worry about this much though)"
one is an Integer, say "j".  The function/procedure will take the
integer, lets assume j=1234567, and add commas outputting to the
screen like 1,234,567.  TWO IMPORTANT THINGS: function MUST use
RECURSION, and at the end of the function/procedure "j" but be the
same as it was coming into the function(change it back if it is messed
with).
You DONT have to write the code, word for word because I am not
writing the program in C++ exactly, but a good skeleton would be nice.
Thanks.

---

Clarification of Question by linkinpark-ga on 23 May 2003 10:37 PDT

Sorry, It will be a function/precedure, not a program in the first
sentence of my question

---

Clarification of Question by linkinpark-ga on 23 May 2003 10:54 PDT

more important things, assume you have these operations:
n.removenum(i): "removes last digit of n, asigns that digit to i"
n.appendnum(i): "appends 'i' to end of 'n'"
n.length():length of n
n.compare(n2):returns -1 if n<n2, 1 if n>n2, 0 if n=n2

that should be it