views:

294

answers:

1

Does anyone know of any good .NET books that focus on algorithmic complexity specifically looking at Big O Notation?

The only book I have found is Data Structures and Algorithms Using C# by Michael McMillan but unfortunately (based on Amazon reviews) this does not appear to be the greatest....

Any other suggestions would be much appreciated! Thanks in advance

+2  A: 

If you want a good book on algorithms, you're probably going to have to live with the fact that it ignores anything as ephemeral as .NET. Knuth even goes to some trouble explaining why he chose to invent MIX AL to use for the demonstrations in his books. Others (e.g. Introduction to Algorithms, by Cormen, et al) mostly stick to pseudo-code and leave it at that.

Jerry Coffin
In fact, I'd argue that algorithmic complexity is *best* understood in pseudocode (or a teaching language like MIX). Trying to study complexity in a real-world language is just going to bog you down with irrelevant details.
Tyler McHenry