AlgorithmsIlluminated

Algorithms are at the core of computer science, with applications that range from network routing to computational genomics, public-key cryptography, and machine learning. Studying algorithms can improve your programming skills, enhance your analytical thinking, and help you ace technical interviews.

Algorithms Illuminated is an accessible introduction to the subject, suitable for those with some programming experience. This book emphasizes conceptual understanding over technical details, offering a transcript-like explanation of what an expert tutor would convey in a one-on-one lesson.

Part 1 of the book covers the essentials of algorithms, including asymptotic analysis and big-O notation, divide-and-conquer algorithms and the master method, randomized algorithms, and a selection of famous algorithms for sorting and selection.

作者简介

TimRoughgardenisaProfessorofComputerScienceand(bycourtesy)ManagementScienceandEngineeringatStanfordUniversity,wherehehastaughtandresearchedalgorithmssince2004.Thisbookisthefirstofafour-partseriesbasedonhisonlinealgorithmscoursesthathavebeenrunningregularlysince2012.