Knygos.lt nariams
Knygos.lt nariams
- Išsiųsime per 12–18 d.d.
/images/books/4784872/9780999282908.jpg)
- Autorius: Tim Roughgarden
- Leidėjas: Soundlikeyourself Publishing, LLC
- Metai: 2017
- Puslapiai: 216
- ISBN-10: 0999282905
- ISBN-13: 9780999282908
- Formatas: 15.2 x 22.9 x 1.3 cm, minkšti viršeliai
- Kalba: Anglų
Atsiliepimai
Aprašymas
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 1 covers asymptotic analysis and big-O notation, divide-and-conquer algorithms and the master method, randomized algorithms, and several famous algorithms for sorting and selection.
- Autorius: Tim Roughgarden
- Leidėjas: Soundlikeyourself Publishing, LLC
- Metai: 2017
- Puslapiai: 216
- ISBN-10: 0999282905
- ISBN-13: 9780999282908
- Formatas: 15.2 x 22.9 x 1.3 cm, minkšti viršeliai
- Kalba: Anglų
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 1 covers asymptotic analysis and big-O notation, divide-and-conquer algorithms and the master method, randomized algorithms, and several famous algorithms for sorting and selection.
Atsiliepimai