- Tapa blanda: 562 páginas
- Editor: O'Reilly Media; Edición: 1 (15 de agosto de 1999)
- Colección: Mastering
- Idioma: Inglés
- ISBN-10: 1565924533
- ISBN-13: 978-1565924536
- Valoración media de los clientes: 1 opinión de cliente
- Clasificación en los más vendidos de Amazon: nº164.796 en Libros en idiomas extranjeros (Ver el Top 100 en Libros en idiomas extranjeros)
- Ver el Índice completo
Compara Precios en Amazon
+ Envío GRATIS
+ EUR 3,15 de gastos de envío
Mastering Algorithms with C (Inglés) Tapa blanda – 15 ago 1999
|Nuevo desde||Usado desde|
Los clientes que compraron este producto también compraron
Descripción del producto
'This is an O'Reilly book, surely one of the best publishers of technical books areound. I love 'em, from the animal cover to the Colophon, and it is rare indeed that I come across an O'Reilly book that I regret buying....So, all in all, an enjoyable book and one I will move onto my Important Algorithm Book shelf, rather than on the floor in a pile with the also-rans. Recommended.' - Julian M Bucknall Developers Review, August 2000
Reseña del editor
There are many books on data structures and algorithms, including some with useful libraries of C functions. Mastering Algorithms with C offers you a unique combination of theoretical background and working code. With robust solutions for everyday programming tasks, this book avoids the abstract style of most classic data structures and algorithms texts, but still provides all of the information you need to understand the purpose and use of common programming techniques.
Implementations, as well as interesting, real-world examples of each data structure and algorithm, are included.
Using both a programming style and a writing style that are exceptionally clean, Kyle Loudon shows you how to use such essential data structures as lists, stacks, queues, sets, trees, heaps, priority queues, and graphs. He explains how to use algorithms for sorting, searching, numerical analysis, data compression, data encryption, common graph problems, and computational geometry. And he describes the relative efficiency of all implementations. The compression and encryption chapters not only give you working code for reasonably efficient solutions, they offer explanations of concepts in an approachable manner for people who never have had the time or expertise to study them in depth.
Anyone with a basic understanding of the C language can use this book. In order to provide maintainable and extendible code, an extra level of abstraction (such as pointers to functions) is used in examples where appropriate. Understanding that these techniques may be unfamiliar to some programmers, Loudon explains them clearly in the introductory chapters.
- Analysis of algorithms
- Data structures (lists, stacks, queues, sets, hash tables, trees, heaps, priority queues, graphs)
- Sorting and searching
- Numerical methods
- Data compression
- Data encryption
- Graph algorithms
- Geometric algorithms
No es necesario ningún dispositivo Kindle. Descárgate una de las apps de Kindle gratuitas para comenzar a leer libros Kindle en tu smartphone, tablet u ordenador.
Obtén la app gratuita:
Detalles del producto
Si eres el vendedor de este producto, ¿te gustaría sugerir ciertos cambios a través del servicio de atención al vendedor?
Opiniones de clientes
Principales opiniones de clientes
Ha surgido un problema al filtrar las opiniones justo en este momento. Vuelva a intentarlo en otro momento.
Recomiendo su compra.
Opiniones de clientes más útiles en Amazon.com
Tech books and Kindle don’t usually get along, but there are some great exceptions to this, such as CLR via C# (Richter), but with this book many of the code samples look like an absolute mess because of all the asterisks spanning across the pages (since the Kindle is only so wide and I can only have the font so small).
Every single comment is formatted as follows. It doesn’t matter if you’re in the middle of an if-loop or other control structure, they all go like:
/************************** (except instead of 30 asterisks there’s always 80!)
Comment goes here
/************************** (another 80 stars here)
(another blank space)
That’s right , every comment takes up 9 lines if your screen is wide enough, even more if characters have to wrap around! It’s completely crazy that the author thinks this is an acceptable commenting style, it’s actually the worst I’ve seen in my entire 18 year career.
It would be one thing if these comments were only at the very top of the code snippet or above a method signature or something, but this is his standard commenting style throughout the code, and he writes a LOT of comments, it really beaks up the flow.
First, my five stars is kind of dependent upon the audience. You shouldn't buy this to teach yourself algorithms, it isn't a textbook. Instead it's quite good as a reference book for how algorithms you know pseudo for should be properly implemented in C. It's also enormously useful for data structure implementation, which can be tricky if you come from mainly using a language without pointers.
The only downside is its bigger than necessary due to comment size, but unlike others I don't think the book should really be judged on editor induced padding. It's a solid reference with excellent diagrams and clear explanations.