Algorithms learning recommendations - Revision history

Vipul: /* Recommendations for learning algorithms proper */

2014-02-08T21:12:27Z

Recommendations for learning algorithms proper

← Older revision		Revision as of 21:12, 8 February 2014
Line 6:		Line 6:
	! Book !! Author(s) !! ISBN and purchase links !! What we're recommending it for		! Book !! Author(s) !! ISBN and purchase links !! What we're recommending it for
	\|-		\|-
	\| ''Introduction to Algorithms'' (popularly called CLRS after the initials of the authors \|\| Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein \|\| ISBN 978-0262033848, [http://www.amazon.com/Introduction-Algorithms-Thomas-H-Cormen/dp/0262033844 Amazon hardcover] \|\| This is a standard comprehensive textbook on algorithms (it also has its own [[wikipedia:Introduction to Algorithms\|Wikipedia page]]. Because of its popularity and widespread use, you are also likely to find people to discuss the book with in online communities of people learning algorithms. For instance, there is a [http://www.quora.com/Introduction-to-Algorithms-book Quora topic devoted to the book], and at least two Quora questions of general interest in the topic: [http://www.quora.com/Introduction-to-Algorithms-book/What-are-some-good-tips-to-read-CLRS-and-understand-the-proofs-for-runtime-or-input-size-mostly-properly here] and [http://www.quora.com/Algorithms/Is-it-worth-reading-an-algorithm-book-like-CLRS-or-Kleinberg-Tardos-from-cover-to-cover-or-should-I-spend-my-time-solving-problems here].		\| ''Introduction to Algorithms'' (popularly called CLRS after the initials of the authors \|\| Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein \|\| ISBN 978-0262033848, [http://www.amazon.com/Introduction-Algorithms-Thomas-H-Cormen/dp/0262033844 Amazon hardcover] \|\| This is a standard comprehensive textbook on algorithms (it also has its own [[wikipedia:Introduction to Algorithms\|Wikipedia page]]). Because of its popularity and widespread use, you are also likely to find people to discuss the book with in online communities of people learning algorithms. For instance, there is a [http://www.quora.com/Introduction-to-Algorithms-book Quora topic devoted to the book], and at least two Quora questions of general interest in the topic: [http://www.quora.com/Introduction-to-Algorithms-book/What-are-some-good-tips-to-read-CLRS-and-understand-the-proofs-for-runtime-or-input-size-mostly-properly here] and [http://www.quora.com/Algorithms/Is-it-worth-reading-an-algorithm-book-like-CLRS-or-Kleinberg-Tardos-from-cover-to-cover-or-should-I-spend-my-time-solving-problems here].
	\|-		\|-
	\| ''Algorithms'' \|\| Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani \|\| ISBN 978-0073523408, [http://www.amazon.com/Algorithms-Sanjoy-Dasgupta/dp/0073523402/ Amazon paperback] \|\| This is a somewhat shorter text that covers all the important ideas, so it might be quicker to get through. See also the Amazon reviews of the book.		\| ''Algorithms'' \|\| Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani \|\| ISBN 978-0073523408, [http://www.amazon.com/Algorithms-Sanjoy-Dasgupta/dp/0073523402/ Amazon paperback] \|\| This is a somewhat shorter text that covers all the important ideas, so it might be quicker to get through. See also the Amazon reviews of the book.

Vipul at 20:19, 15 January 2014

2014-01-15T20:19:19Z

@@ Line 9: / Line 9: @@
 |-
 | ''Algorithms'' || Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani  || ISBN 978-0073523408, [http://www.amazon.com/Algorithms-Sanjoy-Dasgupta/dp/0073523402/ Amazon paperback] || This is a somewhat shorter text that covers all the important ideas, so it might be quicker to get through. See also the Amazon reviews of the book.
 |}

Vipul: Created page with "{{subject learning recommendations|algorithms}} ==Recommendations for learning algorithms proper== {| class="sortable" border="1" ! Book !! Author(s) !! ISBN and purchase li..."

2014-01-15T20:16:01Z

Created page with "{{subject learning recommendations|algorithms}} ==Recommendations for learning algorithms proper== {| class="sortable" border="1" ! Book !! Author(s) !! ISBN and purchase li..."

New page

{{subject learning recommendations|algorithms}}

==Recommendations for learning algorithms proper==

{| class="sortable" border="1"
! Book !! Author(s) !! ISBN and purchase links !! What we're recommending it for
|-
| ''Introduction to Algorithms'' (popularly called CLRS after the initials of the authors || Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein || ISBN 978-0262033848, [http://www.amazon.com/Introduction-Algorithms-Thomas-H-Cormen/dp/0262033844 Amazon hardcover] || This is a standard comprehensive textbook on algorithms (it also has its own [[wikipedia:Introduction to Algorithms|Wikipedia page]]. Because of its popularity and widespread use, you are also likely to find people to discuss the book with in online communities of people learning algorithms. For instance, there is a [http://www.quora.com/Introduction-to-Algorithms-book Quora topic devoted to the book], and at least two Quora questions of general interest in the topic: [http://www.quora.com/Introduction-to-Algorithms-book/What-are-some-good-tips-to-read-CLRS-and-understand-the-proofs-for-runtime-or-input-size-mostly-properly here] and [http://www.quora.com/Algorithms/Is-it-worth-reading-an-algorithm-book-like-CLRS-or-Kleinberg-Tardos-from-cover-to-cover-or-should-I-spend-my-time-solving-problems here].
|-
| ''Algorithms'' || Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani || ISBN 978-0073523408, [http://www.amazon.com/Algorithms-Sanjoy-Dasgupta/dp/0073523402/ Amazon paperback] || This is a somewhat shorter text that covers all the important ideas, so it might be quicker to get through. See also the Amazon reviews of the book.
|}