Algorithms Illuminated, Part 1: The Basics

Algorithms Illuminated, Part 1: The Basics
ISBN-10
0999282905
ISBN-13
9780999282908
Category
Computer algorithms
Pages
218
Language
English
Published
2017-09-27
Author
Tim Roughgarden

Description

Algorithms Illuminated is an accessible introduction to algorithms for anyone with at least a little programming experience, based on a sequence of popular online courses. Part 1 covers asymptotic analysis and big-O notation, divide-and-conquer algorithms, randomized algorithms, and several famous algorithms for sorting and selection.

Get the book

Amazon.com
Amazon.com
Search the book
eBay.com
eBay.com
Search the book

Similar books

  • Algorithms Illuminated (Part 2): Graph Algorithms and Data Structures
    Algorithms Illuminated (Part 2): Graph Algorithms and Data Structures
    By Tim Roughgarden

    Algorithms Illuminated is an accessible introduction to algorithms for anyone with at least a little programming experience, based on a sequence of popular online courses.

  • Algorithms Illuminated (Part 4): Algorithms for NP-Hard Problems
    Algorithms Illuminated (Part 4): Algorithms for NP-Hard Problems
    By Tim Roughgarden

    Includes hints of solutions to all quizzes and problems, and a series of YouTube videos by the author accompanies the book.

  • Algorithms Illuminated: Graph algorithms and data structures. Part 2
    By Tim Roughgarden

    Algorithms Illuminated: Graph algorithms and data structures. Part 2

  • Beyond the Worst-Case Analysis of Algorithms
    Beyond the Worst-Case Analysis of Algorithms
    By Tim Roughgarden

    Introduces exciting new methods for assessing algorithms for problems ranging from clustering to linear programming to neural networks.

  • Algorithms
    Algorithms
    By Kevin Wayne, Robert Sedgewick

    This book is Part I of the fourth edition of Robert Sedgewick and Kevin Wayne’s Algorithms , the leading textbook on algorithms today, widely used in colleges and universities worldwide. Part I contains Chapters 1 through 3 of the book.

  • How to Think About Algorithms
    How to Think About Algorithms
    By Jeff Edmonds

    He stresses paradigms such as loop invariants and recursion to unify a huge range of algorithms into a few meta-algorithms. The book fosters a deeper understanding of how and why each algorithm works.

  • Twenty Lectures on Algorithmic Game Theory
    Twenty Lectures on Algorithmic Game Theory
    By Tim Roughgarden

    (Cited on pages xi, 69, and 83.) Hartline, J. D. and Kleinberg, R. D. (2012). Badminton and the science of rule making. The Huffington Post. (Cited on page 9.) Hartline, J. D. and Roughgarden, T. (2009). Simple versus optimal mechanisms ...

  • Grokking Algorithms: An illustrated guide for programmers and other curious people
    Grokking Algorithms: An illustrated guide for programmers and other curious people
    By Aditya Bhargava

    "This book does the impossible: it makes math fun and easy!

  • Computer Science Illuminated
    Computer Science Illuminated
    By John Lewis, Nell B. Dale

    Within six weeks of beginning to program, Maurice Wilkes made one of the most farreaching discoveries of the computer age: to get programs right is more difficult than it Martin Campbell-Kelly, "Historical Reflections," Communications ...

  • Algorithms
    Algorithms
    By Kevin Wayne, Robert Sedgewick

    This book is Part II of the fourth edition of Robert Sedgewick and Kevin Wayne’s Algorithms , the leading textbook on algorithms today, widely used in colleges and universities worldwide. Part II contains Chapters 4 through 6 of the book.