Hacker News Board Hacker News, browsed like a classic message board
Live data from Hacker News

Introduction to Algorithms: A Creative Approach by Udi Manber [pdf]

doc.lagout.org

Post reply on HN
Print view View original

31–38 of 38 posts

Re: Introduction to Algorithms: A Creative Approach by Udi Manber [pdf]

#31

Post by HenryOakley »

russfink wrote: post #25

I hate to throw shade on this, but look at theorem 2.1, proving by induction that x*n - 1 is divisible by x-1. The concluding sentence I believe mistakenly refers to the left hand term, when they intend to refer to the right hand term. "But the left term is divisible by x - 1 by the induction hypothesis, and the right term is just x-1.". I would spend many hours staring at that sentence wondering why I "just" did not…

I had to look at theorem 2.1 to verify you had blatantly mistyped the theorem itself. Was that just to mess with us? :)

Re: Introduction to Algorithms: A Creative Approach by Udi Manber [pdf]

#33

Post by ninepoints »

russfink wrote: post #25

I hate to throw shade on this, but look at theorem 2.1, proving by induction that x*n - 1 is divisible by x-1. The concluding sentence I believe mistakenly refers to the left hand term, when they intend to refer to the right hand term. "But the left term is divisible by x - 1 by the induction hypothesis, and the right term is just x-1.". I would spend many hours staring at that sentence wondering why I "just" did not…

Err no they mean the left "addend" technically but they are definitely talking about the RHS of the equation (first addend/term of the RHS).

Re: Introduction to Algorithms: A Creative Approach by Udi Manber [pdf]

#34

Post by ouid »

russfink wrote: post #25

I hate to throw shade on this, but look at theorem 2.1, proving by induction that x*n - 1 is divisible by x-1. The concluding sentence I believe mistakenly refers to the left hand term, when they intend to refer to the right hand term. "But the left term is divisible by x - 1 by the induction hypothesis, and the right term is just x-1.". I would spend many hours staring at that sentence wondering why I "just" did not…

Textbooks have separate publications called errata, usually findable on the author's website, or your favorite search engine. You should basically never open up a textbook that you are independently studying from without also opening the errata.

Re: Introduction to Algorithms: A Creative Approach by Udi Manber [pdf]

#35

Post by sceadu »

vram22 wrote: post #32
tims33 wrote: post #16

I took CS 445 Algorithms at Arizona with Udi Manber as the professor in the late 90s. Tough class. The .com boom was picking up at that point and I think he went to Yahoo shortly after.

IIRC he was also at Google.

https://www.youtube.com/watch?v=d1sDsWNIsBs

Re: Introduction to Algorithms: A Creative Approach by Udi Manber [pdf]

#36

Post by michaelcampbell »

commandlinefan wrote: post #9
debanjan16 wrote: post #2

Students learning Algorithms for the first time should never touch CLRS. It is the worst thing that a beginner can pick up. It is good as a reference text. Beginners should start with this. This book "actually" teaches you how algorithms are designed and how to break down problems into chunks and solve them using induction/recursion. Your mind will just be blown.

What infuriated me about CLRS was that so much of the content was in the exercises - that had no answers you could check your results against. There are solutions guides you can look up now, but that they would publish such a hostile math book in the first place rubbed me the wrong way.

> so much of the content was in the exercises

I have this reaction to some Coursera courses (Odersky's Scala course did this to me). I mean it's wonderful if you get the "ah hah" to figure out the exercise, and it's probably the most meaningful learning, but it shouldn't be the ONLY way.

It's like working on some super expensive niche car; if you have the magic tool that fixes your issue it's trivial, if you don't it's almost impossible.

Re: Introduction to Algorithms: A Creative Approach by Udi Manber [pdf]

#37

Post by Breza »

debanjan16 wrote: post #2

Students learning Algorithms for the first time should never touch CLRS. It is the worst thing that a beginner can pick up. It is good as a reference text. Beginners should start with this. This book "actually" teaches you how algorithms are designed and how to break down problems into chunks and solve them using induction/recursion. Your mind will just be blown.

Agreed! I also recommend Grokking Algorithms for a friendly overview. There are also some great topic-specific books, such as Who's #1? and In Pursuit of the Traveling Salesman.
Post reply on HN