|
home—info—lectures—exams—archive
for (int i=0; i<10; ++i) { for (int j=0; j<10; ++j) { print((i*j) mod 10); } print("\n"); // end the line. } |
1 Each equality includes the algorithm's numeralSoFar and num. Writing the answers as a series of equalities like this actually traces of the recursive formulation:
String itos(int n) { return (n==0) ? "" : itos(n/10) + dtos(n%10); } |
home—info—lectures—exams—archive
©2008, Ian Barland, Radford University Last modified 2008.Dec.13 (Sat) |
Please mail any suggestions (incl. typos, broken links) to ibarlandradford.edu |