Bookbot

Algorithms illuminated. Part 2, Graph algorithms and data structures

Ocena książki

Parametry

  • 221 stron
  • 8 godzin czytania

Więcej o książce

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 2 covers graph search and applications, shortest paths, and the usage and implementation of several data structures (heaps, search trees, hash tables, and bloom filters).

Zakup książki

Algorithms illuminated. Part 2, Graph algorithms and data structures, Tim Roughgarden

Język
Rok wydania
2018
Oprawa
(miękka)
Jak tylko się pojawi, wyślemy Ci wiadomość e-mail.

Metody płatności

4,7
Doskonała
22 Ocena

Brakuje nam tutaj Twojej recenzji.

Tytuł
Algorithms illuminated. Part 2, Graph algorithms and data structures
Język
angielski
Rok wydania
2018
Oprawa
miękka
Liczba stron
221
ISBN10
0999282921
ISBN13
9780999282922
Ocena
4,7 z 5
Opis
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 2 covers graph search and applications, shortest paths, and the usage and implementation of several data structures (heaps, search trees, hash tables, and bloom filters).