MARC details
| 000 -LEADER |
|---|
| fixed length control field |
01510 a2200253 4500 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
230903b |||||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9780999282984 |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
519.3 ROU |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Roughgarden, Tim |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
Algorithms illuminated |
| 250 ## - EDITION STATEMENT |
|---|
| Edition statement |
omnibus ed. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Place of publication, distribution, etc |
New York: |
| Name of publisher, distributor, etc |
Soundlikeyourself Publishing, |
| Date of publication, distribution, etc |
2022. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xvii, 671p.: |
| Other physical details |
ill.; hbk.: |
| Dimensions |
26cm. |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc |
Includes Epilogue, Hints and Solutions and Index |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
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 |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Algorithms |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Asymptotic notation |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Divide-and-Conquer algorithms |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Linear-time selection |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Graph Algorithms |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Dijkstra's shortest-path algorithm |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Hash tables |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Item type |
Books |
| Source of classification or shelving scheme |
Dewey Decimal Classification |
