Object) or else they’re implemented… strangely? (E.g., his
Dictionary implementation uses an
Array under the hood for no good reason.)
Disclosure: I received an electronic copy of this book from the publisher in exchange for writing this review.
- I reviewed Understanding Computation last year. It was the first book that helped me to really understand the differences between “computer science” and “software engineering”. [↩]
- As condescending as it sounds, there were a couple of times where I thought a good subtitle for it might have been something like “A Field Guide to Real World Computer Science”. [↩]
- …had we made it all the way through our introductory computer science courses. Which… you know… I didn’t. [↩]
- Long-time readers of this blog will notice the restraint I’m using here by not invoking what I’ve come to think of as “Miraglia’s Assertion”. Or at least resisting the urge to put that in the main body text. [↩]
- I deal with sets fairly often in my work and say what you will about Groovy but at least I don’t have to monkey-patch in support for sets. [↩]
- He says something in the text about using an
Arraybecause we want to output the
Dictionarykeys in alphabetical order, but then he winds up using
Object.keysfor that anyway and I just frowned and scratched my head a whole bunch there. [↩]
About Rob FrieselSoftware engineer by day, science fiction writer by night. Author of The PhantomJS Cookbook and a short story in Please Do Not Remove. View all posts by Rob Friesel →
My only questions are:
Does this book follow the EXACT implementation of these algorithms STRICTLY as any other book I may pick up? (Logical implementation, given any variance of the language implemented in).
Does this book go over Linked-Lists?
The second (easy) question first: yes, McMillan covers linked lists — and doubly- and circularly-linked lists.