Trending Bestseller

Algorithms Illuminated (Part 3)

Greedy Algorithms and Dynamic Programming

No reviews yet Write a Review
Paperback / softback
09 May 2019
RRP: $32.66
$31.52
Ships in 3-5 business days

Delivery estimate

Hurry up! Current stock:

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).

You Can Find This Title In

    Product Details
    ISBN-13
    9780999282946
    Author
    Tim Roughgarden
    Publisher
    Soundlikeyourself Publishing, LLC
    Published
    09 May 2019
    Format
    Paperback / softback

    This product hasn't received any reviews yet. Be the first to review this product!

    RRP: $32.66
    $31.52
    Ships in 3-5 business days

    Delivery estimate

    Hurry up! Current stock:

    Algorithms Illuminated (Part 3)

    RRP: $32.66
    $31.52

    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).

    You Can Find This Title In

      This Title Is Categorised As