Opening book details…
Can I read Algorithms in C (Computer Science Series) on EtoBox?
Algorithms in C (Computer Science Series) by Robert Sedgewick is a book available to read on EtoBox.
What is Algorithms in C (Computer Science Series) about?
Robert Sedgewick has thoroughly rewritten and substantially expanded his popular work to provide current and comprehensive coverage of important algorithms and data structures. Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 250,000 programmers! Whether you are a student learning the algorithms for the first time or a professional interested in having up-to-date reference material, you will find a wealth of useful information in this book.
- Author
- Robert Sedgewick
- Publisher
- Addison-Wesley Professional
- Published
- 1990
- Language
- EN
- ISBN
- 9780768682335
- Subjects
- Computer Science, Reference
- Rating
- 3.8 / 5 (47 ratings)
- Updated
- 2026-03-14
Other editions & translations
More by Robert Sedgewick
Browse all works by Robert Sedgewick
Similar books
- Algorithms in Java : Parts 1-4, Fundamentals, Data Structures, Sorting, Searching — Michael Schidlowsky Robert Sedgewick (2003)
- Handbook of Algorithms and Data Structures: Coded in Pascal and C (International Computer Science Series) — Gonnet, G. H. (Gaston H.) (1984)
- Algorithms and Data Structures in C++ (Computer Science & Engineering) — Parker, Alan, (1993)
- Algorithms in C. Part 5, Graph algorithms = 算法 C语言实现. 第5部分, 图算法(英文版·第3版) — Robert Sedgewick, (美)Robert Sedgewick著, 塞奇威克, (美) 塞奇威克, R (2006)
- Introduction to Algorithms (MIT Electrical Engineering and Computer Science) — Cormen, Thomas H., Leiserson, Charles E., Rivest, Ronald L. (1999)
- Super-Recursive Algorithms (Monographs in Computer Science) — Mark Burgin (2004)