TY  - GEN
AU  - Roughgarden, Tim
TI  - Algorithms illuminated
SN  - 9780999282984
U1  - 519.3 ROU	 
PY  - 2022///
CY  - New York
PB  - Soundlikeyourself Publishing
KW  - Algorithms
KW  - Asymptotic notation
KW  - Divide-and-Conquer algorithms
KW  - Linear-time selection
KW  - Graph Algorithms
KW  - Dijkstra's shortest-path algorithm
KW  - Hash tables
N1  - Includes Epilogue, Hints and Solutions and Index
N2  - 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
ER  -