Talk:Bernstein basis polynomials: Difference between revisions
Content added Content deleted
| Line 12: | Line 12: | ||
As for "Subprogram (1)", "Subprogram (2)", etc., these are not the names of subroutines. They are reference numbers, akin to "Equation (1)", "Equation (2)", etc. If you think these are stupid "names", then what about Donald Knuth using "Algorithm M" for a long multiplication routine, etc., in his classic ''The Art of Computer Programming''? |
As for "Subprogram (1)", "Subprogram (2)", etc., these are not the names of subroutines. They are reference numbers, akin to "Equation (1)", "Equation (2)", etc. If you think these are stupid "names", then what about Donald Knuth using "Algorithm M" for a long multiplication routine, etc., in his classic ''The Art of Computer Programming''? |
||
:: I would level the same criticism against the great DK, and be five times as vociferous had he used "Algorithm M1".."Algorithm M5". |
:: I would level the same criticism against the great DK, and be five times as vociferous had he used "Algorithm M1".."Algorithm M5".<br> |
||
:: I don't actually know the book/text you refer to, but given the chance I would say to him: at least call it "Algorithm LM". |
|||
And I do not see that merging the parts of the task would serve any purpose except to make the writing sound less like technical writing, and to make it easier for a reader to accidentally skip one part of the task. |
And I do not see that merging the parts of the task would serve any purpose except to make the writing sound less like technical writing, and to make it easier for a reader to accidentally skip one part of the task. |
||