Looking for a book on algorithm design...

Discussion in 'Mac Programming' started by MorphingDragon, Sep 27, 2010.

  1. macrumors 603


    Mar 27, 2009
    The World Inbetween
    I'm looking for a book (Well it doesn't actually have to be a book, so something) on algorithm design and optimisation (theoretical or practical). The library has a TON of them, but I'm looking for one or two good ones.

    I only got a B+ for one of my recent practical assessments and the tutor marking it said my algorithm was not efficient enough to warrant an A grade.
  2. macrumors 6502

    Jun 22, 2010
  3. thread starter macrumors 603


    Mar 27, 2009
    The World Inbetween
  4. macrumors 6502a

    I would probably go for something like this:


    I *think* this is the course book for one of the MIT open courseware series and covers lots of theory.

    I would also recommend
    for a run down of a whole host of algorithms, but more from the perspective of finding the right algorithm for a 'real world' problem at hand

    This is also a good summary book:
    Does what it says on the tin

    There are also some lower level books (I don't have them, so am hesitant to recommend), I think Sedgwick "Algorithms in C"

    Really depends on what you want or mean by "algortihm design", though
  5. macrumors 603


    Oct 2, 2006
    The Land of Hope and Glory
    Yes, this is a good book. I'm still hoping I'll be able to pick up another book like it but finances are bit tight for these book prices at the moment :).
  6. macrumors 603

    Aug 9, 2009
    I have the Sedgewick book (note spelling of author's name). I highly recommend it. Like I recently did here:

    It's a book that's been around for a while, so check for it in a library, and evaluate it before deciding to purchase.
  7. thread starter macrumors 603


    Mar 27, 2009
    The World Inbetween
    Didn't Sedwick design the quick-sort algorithm?

    I booked that MIT Introduction to Algorithms for about a month.
  8. macrumors G5


    Nov 25, 2005
  9. macrumors 603

    Aug 9, 2009

    Oh, and I liked this book some years ago:

    Pity I lent the book and never got it back. It was on my "buy again" list, then web searching got better, so I haven't bought it again. Worth checking out at the library, though.

    Also, I own the Knuth "trilogy", but I find that I only really use them if another simpler description can't be found. Useful as definitive references, but not so much in everyday use. I wouldn't buy them again if I lived near a good engineering library.

    For everyday use I usually search Wikipedia first. It's not always comprehensive, but it's pretty good, and many of the articles have good descriptions and diagrams. And practically every article worth reading has See Also and External Links for times when excruciating details are needed. For example, look up radix sort, and you get a summary (stable for LSD, O(kn)), the algorithm (with variants: LSD, MSD), as well as links to other kinds of sort algorithms.
  10. macrumors 6502

    Apr 9, 2006
    Boston, MA
    Yeah Introduction to Algorithms by CLRS is the book used by at least 2 algorithm classes at MIT (6.006 - Introduction to Algorithms and 6.046 Design and Analysis of Algorithms and maybe some higher level ones too, but not sure on that), it's an amazing book, although some of the heuristics aren't mentioned as much (it's more focused on runtime analysis, not so much the constants). I highly recommend it.

    Algorithms in a Nutshell seems to be a bit more focused on the programming aspects (although I haven't read it much, I own the CLRS book though), which might be good for you too.
  11. macrumors 6502

    Aug 10, 2008
    I used "Introduction to Algorithms " by Cormen for my undergrad course. It had a good balance of theory and practice. I believe it is considered some what of a "standard" for algorithms.

Share This Page