Algorithms illuminated
Roughgarden, Tim
Algorithms illuminated - omnibus ed. - New York: Soundlikeyourself Publishing, 2022. - xvii, 671p.: ill.; hbk.: 26cm.
Includes Epilogue, Hints and Solutions and Index
In Algorithms Illuminated, Tim Roughgarden teaches the basics of algorithms in the most accessible way imaginable. This Omnibus Edition contains the complete text of Parts 1-4, with thorough coverage of asymptotic analysis, graph search and shortest paths, data structures, divide-and-conquer algorithms, greedy algorithms, dynamic programming, and NP-hard problems. Hundreds of worked examples, quizzes, and exercises, plus comprehensive online videos, help readers become better programmers; sharpen their analytical skills; learn to think algorithmically; acquire literacy with computer science's greatest hits; and ace their technical interviews.
https://www.cambridge.org/highereducation/books/algorithms-illuminated/3985B4112D84FF51DBE6E072463C1350#overview
9780999282984
Algorithms
Asymptotic notation
Divide-and-Conquer algorithms
Linear-time selection
Graph Algorithms
Dijkstra's shortest-path algorithm
Hash tables
519.3 ROU
Algorithms illuminated - omnibus ed. - New York: Soundlikeyourself Publishing, 2022. - xvii, 671p.: ill.; hbk.: 26cm.
Includes Epilogue, Hints and Solutions and Index
In Algorithms Illuminated, Tim Roughgarden teaches the basics of algorithms in the most accessible way imaginable. This Omnibus Edition contains the complete text of Parts 1-4, with thorough coverage of asymptotic analysis, graph search and shortest paths, data structures, divide-and-conquer algorithms, greedy algorithms, dynamic programming, and NP-hard problems. Hundreds of worked examples, quizzes, and exercises, plus comprehensive online videos, help readers become better programmers; sharpen their analytical skills; learn to think algorithmically; acquire literacy with computer science's greatest hits; and ace their technical interviews.
https://www.cambridge.org/highereducation/books/algorithms-illuminated/3985B4112D84FF51DBE6E072463C1350#overview
9780999282984
Algorithms
Asymptotic notation
Divide-and-Conquer algorithms
Linear-time selection
Graph Algorithms
Dijkstra's shortest-path algorithm
Hash tables
519.3 ROU