• Precio final del producto
Envío GRATIS. Ver detalles
En stock.
Vendido y enviado por Amazon. Se puede envolver para regalo.
Algorithms in C, Parts 1-... se ha añadido a la cesta
+ EUR 5,99 de gastos de envío
De 2ª mano: Bueno | Detalles
Estado: De 2ª mano: Bueno
Comentario: Buy with confidence. Excellent Customer Service & Return policy.Ships from USA. Please give between 2-5 week for delivery. 24*7 Customer Service.
Compara precios en Amazon
Añadir a la cesta
EUR 85,32
Envío GRATIS
Vendido por: The_Book_Depository_ES
¿Tienes uno para vender? Vender en Amazon
Volver atrás Ir adelante
Escuchar Reproduciendo... Interrumpido   Muestra de la versión audiolibro de Audible.
Más información
Ver las 3 imágenes

Sigue al autor

Se ha producido un error. Prueba a realizar la solicitud de nuevo.


Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching: Fundamentals, Data Structures, Sorting, Searching Pts. 1-4 (Inglés) Tapa blanda – 17 sep 1997


Ver los 5 formatos y ediciones Ocultar otros formatos y ediciones
Precio Amazon
Nuevo desde Usado desde
Versión Kindle
Tapa blanda
EUR 83,09
EUR 63,02 EUR 16,94

Compra este producto y disfruta de 90 días gratis de Amazon Music Unlimited
Después de tu compra, recibirás un email con más información sobre cómo disfrutar de 90 días gratuitos de Amazon Music Unlimited. Descúbrelo
click to open popover

Descripción del producto

Reseña del editor

"This is an eminently readable book which an ordinary programmer, unskilled in mathematical analysis and wary of theoretical algorithms, ought to be able to pick up and get a lot out of.." - Steve Summit, author of C Programming FAQs Sedgewick has a real gift for explaining concepts in a way that makes them easy to understand. The use of real programs in page-size (or less) chunks that can be easily understood is a real plus. The figures, programs, and tables are a significant contribution to the learning experience of the reader; they make this book distinctive. - William A. Ward, University of South Alabama 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! This particular book, Parts 1-4, represents the essential first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. The algorithms and data structures are expressed in concise implementations in C, so that you can both appreciate their fundamental properties and test them on real applications. Of course, the substance of the book applies to programming in any language. Highlights Expanded coverage of arrays, linked lists, strings, trees, and other basic data structures Greater emphasis on abstract data types (ADTs) than in previous editions Over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations New implementations of binomial queues, multiway radix sorting, Batcher's sorting networks, randomized BSTs, splay trees, skip lists, multiway tries, and much more Increased quantitative information about the algorithms, including extensive empirical studies and basic analytic studies, giving you a basis for comparing them Over 1000 new exercises to help you learn the properties of algorithms 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.

Contraportada

""This is an eminently readable book which an ordinary programmer, unskilled in mathematical analysis and wary of theoretical algorithms, ought to be able to pick up and get a lot out of.."
- Steve Summit, author of "C Programming FAQs "Sedgewick has a real gift for explaining concepts in a way that makes them easy to understand. The use of real programs in page-size (or less) chunks that can be easily understood is a real plus. The figures, programs, and tables are a significant contribution to the learning experience of the reader; they make this book distinctive.
- William A. Ward, University of South Alabama" 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! This particular book, Parts 1-4, represents the essential first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. The algorithms and data structures are expressed in concise implementations in C, so that you can both appreciate their fundamental properties and test them on real applications. Of course, the substance of the book applies to programming in any language.Highlights

  • Expanded coverage of arrays, linked lists, strings, trees, and other basic data structures
  • Greater emphasis on abstract data types (ADTs) than in previous editions
  • Over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations
  • New implementations of binomial queues, multiway radix sorting, Batcher's sorting networks, randomized BSTs, splay trees, skip lists, multiway tries, and much more
  • Increased quantitative information about the algorithms, including extensive empirical studies and basic analytic studies, giving you a basis for comparing them
  • Over 1000 new exercises to help you learn the properties of algorithms
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.

Ver Descripción del producto

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.

  • Apple
    Apple
  • Android
    Android
  • Windows Phone
    Windows Phone

Obtén la app gratuita:

kcpAppSendButton


Libros en Estudios Superiores
Universidad, Máster, Formación Profesional, descubre nuestra tienda de libros de Estudios Superiores.

Detalles del producto


Ninguna opinión de cliente


Valorar este producto

Comparte tu opinión con otros clientes

Opiniones de clientes más útiles en Amazon.com

Amazon.com: 3,7 de 5 estrellas 13 opiniones
Jjeff
5,0 de 5 estrellasWorth 10 stars for the algorithms it explains
28 de diciembre de 2015 - Publicado en Amazon.com
Compra verificada
Roger
5,0 de 5 estrellasGoood
3 de julio de 2014 - Publicado en Amazon.com
Compra verificada
A una persona le ha parecido esto útil.
Susan
3,0 de 5 estrellasIt must not be easy to write a book talking about the algorithms
7 de septiembre de 2016 - Publicado en Amazon.com
Compra verificada
A 2 personas les ha parecido esto útil.
ThomasH
5,0 de 5 estrellasExceptional love for fine detail of highest quality
20 de enero de 2000 - Publicado en Amazon.com
A 27 personas les ha parecido esto útil.
Amazon Customer
5,0 de 5 estrellasA Classic on Algorithms...
27 de junio de 2007 - Publicado en Amazon.com
A 4 personas les ha parecido esto útil.