My Patient Husband, the inveterate dyed-in-the-wool geek that he is, grabbed the Bible Of Computing in order to look up a bit about recursive functions.
If you’ve never been to our house, you don’t know that sometimes he and I will be working side by side, never talking but very much together. In my head, I’m telling stories about angels, and in his head, he’s programming great big machines and solving computing problems. The problem in this instance is that Embedded Matlab doesn’t allow for recursive functions, so he needed to rewrite a function in a non-recursive way. If you’re looking at the screen kind of baffled, a recursive function is one that calls itself while it’s running. Kind of like if I told you that a habit is an action you do habitually.
At any rate, there he is, with his copy of “Data Structures and Algorithms” by Aho, Hopcroft, and Ullman, (it’s got great character development, but it could use some better scenery) when abruptly he exclaims, “Those whackos!” and starts laughing.
Because he’d gone into the index to look up recursive functions, and there are three pages listed.
The last of the three listings for recursive functions is the index page on which the term “recursive functions” appears.
Oh, those wacky computer scientists!