pre n >= 0(adsbygoogle = window.adsbygoogle || []).push({});

post checksum(n) = CHKSUM(n)

reads n

changes -

mem -

Remark: Let n be an integer number. Furthermore, CHKSUM(n) = “sum of digits of n”. checksum is the name of the module to be developed.

Develop a recursive algorithm for the above specification. Assume and use functions

div function and mod function.

can smby pls show me how to write this algorithm

thanx

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Checksum(n) = CHKSUM(n)

**Physics Forums | Science Articles, Homework Help, Discussion**