Algorithms Illuminated (Part 3): Greedy Algorithms and Dynamic Programming
De (autor): Tim Roughgarden
Algorithms Illuminated (Part 3): Greedy Algorithms and Dynamic Programming
De (autor): Tim Roughgarden
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).
-10%
transport gratuit
PRP: 123.93 Lei
Acesta este Pretul Recomandat de Producator. Pretul de vanzare al produsului este afisat mai jos.
111.54Lei
111.54Lei
123.93 LeiPrimesti 111 puncte
Primesti puncte de fidelitate dupa fiecare comanda! 100 puncte de fidelitate reprezinta 1 leu. Foloseste-le la viitoarele achizitii!
Livrare in 2-4 saptamani
Pentru a putea comanda rapid este nevoie sa introduceti numarul dvs de telefon in formatul 0xxxxxxxxx (10 cifre).Un operator Libris.ro va suna si va cere telefonic restul datelor necesare.
Descrierea produsului
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).
Detaliile produsului
De pe acelasi raft
De acelasi autor
Parerea ta e inspiratie pentru comunitatea Libris!