Roughgarden, Tim <br/><br/>
Algorithms illuminated 

 - omnibus ed. 
 - New York:  Soundlikeyourself Publishing,  2022. 
 - xvii, 671p.:  ill.; hbk.:  26cm. 
<br/><br/>Includes Epilogue, Hints and Solutions and Index 
<br/><br/> 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.<br/><br/>https://www.cambridge.org/highereducation/books/algorithms-illuminated/3985B4112D84FF51DBE6E072463C1350#overview 
<br/><br/><label>ISBN: </label>9780999282984 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Algorithms <br/>Asymptotic notation<br/>Divide-and-Conquer algorithms<br/>Linear-time selection<br/>Graph Algorithms<br/>Dijkstra's shortest-path algorithm<br/>Hash tables
<br/><br/><label>Dewey Class. No.: </label>519.3 ROU