- We will send in 10–14 business days.
/images/books/4784874/9780999282946.jpg)
- Author: Tim Roughgarden
- Publisher: Soundlikeyourself Publishing, LLC
- ISBN-10: 0999282948
- ISBN-13: 9780999282946
- Format: 15.2 x 22.9 x 1.2 cm, minkšti viršeliai
- Language: English
- SAVE -10% with code: EXTRA
Reviews
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).
EXTRA 10 % discount with code: EXTRA
The promotion ends in 22d.17:57:51
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Tim Roughgarden
- Publisher: Soundlikeyourself Publishing, LLC
- ISBN-10: 0999282948
- ISBN-13: 9780999282946
- Format: 15.2 x 22.9 x 1.2 cm, minkšti viršeliai
- Language: English English
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).
Reviews