Scribd Logo
Upload

Welcome to Scribd!

  • Algorithms Illuminated

    Uploaded by

    segovia andres
    1K views1 page
    This book is the first part of a four-part series that provides an accessible introduction to fundamental algorithms concepts. Part 1 covers asymptotic analysis, divide-and-conquer algorithms, randomized algorithms, and classical sorting and selection algorithms. The book is accompanied by video lectures from the author and aims to teach algorithms in a programming language-agnostic way. The author is a professor of computer science at Stanford University who has been teaching algorithms courses online since 2012.

    Original Description:

    Algorithms Illuminated

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This book is the first part of a four-part series that provides an accessible introduction to fundamental algorithms concepts. Part 1 covers asymptotic analysis, divide-and-conquer algorithms, randomized algorithms, and classical sorting and selection algorithms. The book is accompanied by video lectures from the author and aims to teach algorithms in a programming language-agnostic way. The author is a professor of computer science at Stanford University who has been teaching algorithms courses online since 2012.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    1K views1 page

    Algorithms Illuminated

    Uploaded by

    segovia andres
    This book is the first part of a four-part series that provides an accessible introduction to fundamental algorithms concepts. Part 1 covers asymptotic analysis, divide-and-conquer algorithms, randomized algorithms, and classical sorting and selection algorithms. The book is accompanied by video lectures from the author and aims to teach algorithms in a programming language-agnostic way. The author is a professor of computer science at Stanford University who has been teaching algorithms courses online since 2012.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 1

    Algorithms Illuminated: Part 1: The Basics

    Accessible, no-nonsense, and programming language-agnostic introduction to algorithms. Includes


    solutions to all quizzes and selected problems, and a series of YouTube videos by the author
    accompanies the book. 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.

    Editorial Reviews

    About the Author

    Tim Roughgarden is a Professor of Computer Science and (by courtesy) Management Science and
    Engineering at Stanford University, where he has taught and researched algorithms since 2004. This
    book is the first of a four-part series based on his online algorithms courses that have been running
    regularly since 2012.

    Product details

    Series: Algorithms Illuminated (Book 1)

    Paperback: 218 pages

    Publisher: Soundlikeyourself Publishing (September 27, 2017)

    Language: English

    ISBN-10: 0999282905

    ISBN-13: 978-0999282908

    Product Dimensions: 6 x 0.5 x 9 inches

    You might also like