Community Scheme Wiki: Recent Changes


2015-07-28
penultimate elements18:58:42(11 hours ago)show the code running
penultimate elements18:56:33(11 hours ago)created
Programming Praxis problems18:24:47(12 hours ago)added penultimate elements
2015-07-24
sicp-ex-2.5418:15:50(4 days ago)Improve formatting.
sicp-ex-2.5418:13:09(4 days ago)Add solution for Adam.
2015-07-21
sicp-ex-3.8007:58:37(7 days ago)something
2015-07-20
sicp-ex-3.3901:37:03(9 days ago)A comment for answer
2015-07-19
sicp-ex-1.716:06:00(9 days ago)Fixed indentation
sicp-ex-1.716:04:46(9 days ago)New approach
sicp-ex-2.108:46:42(9 days ago)People who edit this code just before me said:"when it comes to two negatives,the gcd is negative,if we use the foreces denominator method,the g is postive,which makes the result still be two negatives.(/ n d)'s sign can do it." This is wrong. The gcd procedure always return a positive number (I tried this in mit-scheme and Racket with neil/sicp package). Therefore the version before last editing is right.