Algorithmic Thinking: A Problem Based Introduction

[paul nisset]

The book looks interesting. The Amazon description didn't say what language the examples use.
While many algorithms apply across the board to many languages equally, do you find that certain algorithms or classes of algorithms are better suited to certain languages?

[Daniel Zingaro]

Hi Paul and all,

I do think so, especially for low-level data structures/algorithms topics like some of those in the book.

For example, hash tables. In C, we don't have them, so we have to write them ourselves. In Python and Java, they're hidden by dictionaries/maps. Since I wanted to explore the core of these data structures, and build them ourselves, I used C for the book.

Thank you,
Dan

[Sebastian Makowiecki]

Thank you for the book. The fact it is written in C makes it even more interesting (at least to me). What level of C-specific experience is required would you say? Thanks again Daniel.

[Daniel Zingaro]

Hi Sebastian,

Thank you! I've done my best to stick to only core C features, nothing too out there. So there are arrays, structs, printf, scanf, dynamic memory when we need it, things like that.

What I recommend in the intro is to just dive in -- and then if a reader gets stuck on something related to C (and if they want a full understanding of those finer points), they can search online or in a C reference to fill in any gaps. I do give a brief tour of a few C features that might be new to some readers.

For those out there who are not familiar with C/C++/Java syntax and instead use Python or another language: I suspect you'll be OK, too, but if any readers want to let me know about any sticking points, that would be appreciated! Most of this stuff looks very similar in many different languages.

Dan

[paul nisset]

Thanks Dan . Your reason for using C is good and should make the book  better for learning the logic behind HashMaps etc.....