Description: Algorithms are the heart and soul of computer science. Their applications range from network routing and computational genomics to public-key cryptography and machine learning. Studying algorithms can make you a better programmer, a clearer thinker, and a master of technical interviews. Algorithms Illuminated is an accessible introduction to the subject for anyone with at least a little programming experience. The exposition emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details---like a transcript of what an expert algorithms tutor would say over a series of one-on-one lessons. Part 3 covers greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, shortest paths, optimal search trees).
Price: 24.81 USD
Location: East Hanover, New Jersey
End Time: 2024-11-06T14:25:55.000Z
Shipping Cost: 0 USD
Product Images
Item Specifics
Return shipping will be paid by: Buyer
All returns accepted: Returns Accepted
Item must be returned within: 60 Days
Refund will be given as: Money Back
Return policy details:
EAN: 9780999282946
UPC: 9780999282946
ISBN: 9780999282946
MPN: N/A
Book Title: Algorithms Illuminated (Part 3): Greedy Algorithms
Number of Pages: 230 Pages
Language: English
Publication Name: Algorithms Illuminated (Part 3) : Greedy Algorithms and Dynamic Programming
Publisher: Soundlikeyourself Publishing, LLC
Publication Year: 2019
Item Height: 0.5 in
Subject: Programming / Algorithms, Computer Science
Item Weight: 11.1 Oz
Type: Textbook
Author: Tim Roughgarden
Subject Area: Computers
Item Length: 9 in
Item Width: 6 in
Series: Algorithms Illuminated Ser.
Format: Trade Paperback
