Editing 163: Donald Knuth
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 4: | Line 4: | ||
| title = Donald Knuth | | title = Donald Knuth | ||
| image = donald_knuth.png | | image = donald_knuth.png | ||
+ | | imagesize = | ||
| titletext = His books were kinda intimidating; rappelling down through his skylight seemed like the best option. | | titletext = His books were kinda intimidating; rappelling down through his skylight seemed like the best option. | ||
}} | }} | ||
==Explanation== | ==Explanation== | ||
− | {{w|Donald Knuth}} is a computer science Professor Emeritus at {{w|Stanford University}} who is famous for writing | + | {{w|Donald Knuth}} is a computer science Professor Emeritus at {{w|Stanford University}} who is famous for writing {{w|The Art of Computer Programming}} and developing the <span class="texhtml"><span style="font-family:cmr10, LMRoman10-Regular, Times, serif;">T<span style="text-transform:uppercase; vertical-align:-0.5ex; margin-left:-0.1667em; margin-right:-0.125em;">e</span>X</span></span> computerized typesetting system. |
− | + | An "array" in computer science is a structure that holds multiple values, and is "indexed" by a number. In Pascal, for instance, one writes <tt>array[1]</tt> to access the first element in the array. Most "modern" (read: descended from C) languages use 0 as the index for the first element in the array, but it is possible (if one is careful about it) to ignore the 0th element and use 1 as the first index. [[Cueball]] is complaining that [[Black Hat]] was not consistent in his choice of where to start his arrays. | |
− | Black Hat | + | [[Black Hat]]'s citation of {{w|Donald Knuth}} implies that he broke into the professors house in the middle of the night, and has nothing to do with the argument over array indexes. |
− | + | ==Transcript== | |
− | + | [Two programmers, one with a black hat and one without a hat, are sitting back to back at two separate desks, typing.] | |
− | |||
− | |||
− | |||
− | |||
− | |||
− | + | No-Hat Programmer: Man, you're being inconsistent with your array indices. Some are from one, some are from zero. | |
− | |||
− | |||
− | |||
− | + | Black-Hat Programmer: Different tasks call for different conventions. To quote Stanford algorithm's expert Donald Knuth, "Who are you? How did you get in my house?" | |
− | |||
− | |||
− | + | No-Hat Programmer: Wait, what? | |
− | |||
− | + | Black-Hat Programmer: Well, that's what he said when I asked him about it. | |
{{comic discussion}} | {{comic discussion}} | ||
− | |||
[[Category:Comics featuring Black Hat]] | [[Category:Comics featuring Black Hat]] | ||
[[Category:Comics featuring Cueball]] | [[Category:Comics featuring Cueball]] | ||
[[Category:Comics featuring Donald Knuth]] | [[Category:Comics featuring Donald Knuth]] | ||
− |