Timeline for Illustrate the square of a binomial
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot | Commonmark migration | |
| Oct 20, 2015 at 17:11 | comment | added | Digital Trauma | @xsot Yes, puts() return code is only guaranteed to be +ve for success. However my testing with glibc seems show that the return value is number of bytes written. As for the loop consolidation - yes, I'm aware of that technique and have tried that here, so far with no shortening in this case. | |
| Oct 20, 2015 at 17:09 | history | edited | Digital Trauma | CC BY-SA 3.0 | added 198 characters in body |
| Oct 20, 2015 at 12:28 | comment | added | xsot | Based on my experience, the return value of puts() is machine dependent. It's 10 on mine for instance. Also, here's a tip: you can usually compress two loops into one if you conditionally increment the counter in the external loop. My solution demonstrates how it can be done. | |
| Oct 19, 2015 at 23:00 | history | edited | Digital Trauma | CC BY-SA 3.0 | added 94 characters in body |
| Oct 19, 2015 at 22:53 | history | edited | Digital Trauma | CC BY-SA 3.0 | added 17 characters in body |
| Oct 19, 2015 at 22:45 | history | answered | Digital Trauma | CC BY-SA 3.0 |