I've tried searching for Data Structure / Algorithms books that provide examples in either Objective-C, or another language supporting keyword message syntax, to no avail. The reason I'm interested in this is because I really think the keyword syntax would help me understand the intent of code, which I find I have to think longer about in languages with typical function call syntax. A good example is this snippet from a implementation in C: /. Continue down the tree./ n = splaytreesplayhelper (sp, key, next, node, parent); The function name is pretty unhelpful, and even with the comment I have to thoroughly read the code to have any idea what's really happening there. I know that technically any piece of C code is valid Objective-C, but I'm looking for something that structures algorithm implementations utilizing a good object model like Objective-C's since I believe the resulting code is more maintainable.

This may seem counter-intuitive in the performance restricted space of algorithm design, but I've seen plenty of Algorithms books that have examples in idiomatic Ruby, Python, Javascript etc. M-go for bluray. Basically I'm looking for anything with a good object model that allows for very descriptive keyword messages, whether it's Objective-C or even (though probably unlikely) anything else in the Smalltalk family. I think you are looking for the wrong thing.

Data Structures And Algorithms In C Word Mojo Gold Online For Mac Free

A good algorithms and data structures books will try to not waste your time with hard to read source code. Most of the good books I know spend most of their time explaining things at a high level and only show actual code in small snippets that can be easily understood independently of the language used and how proficient you are with it. It doesn't matter how convoluted some guy's implementation of splay trees is. As long as you know what the splay tree is you should be able to implement your own version without looking at hit too much.

And finally, a good object model and nice syntax is not the be-all-end-all of things. Many datastructures make use of union types that are not very nicely implemented in OO style and the naming patterns and syntax are things you should be able to get used to very quickly. Again, I did not say that OO was be-all-end-all, only that it's a proven paradigm of code reuse / maintainability and it fits the way I understand things. I'm not claiming, for example, that a DataStructs/Alg book with examples in Haskell wouldn't be useful, but it's not what I'm looking for. Also, while some people may be fine with hand wavy pseudo-code, I personally am not, and prefer to look at something concrete that both explains itself and actually can be quickly looked up and implemented for real world use on demand. – Mar 26 '12 at 20:04.