Invia un buono regalo per il Prime Day
Compra usato
25,88 €
Consegna a 3,36 € 3 - 9 luglio. Ordina entro 10 ore 55 min. Maggiori informazioni
Usato: Ottime condizioni | Dettagli
Venduto da worldofbooksit
Condizione: Usato: Ottime condizioni
Commento: Il libro e' stato letto ma e' in condizioni ottime. Le pagine sono intatte e non sono presenti alcuni segni di note, sottolineature o evidenziamento. La rilegatura non e' danneggiata.
Disponibilità: solo 2
Immagine del logo dell'app Kindle

Scarica l'app Kindle gratuita e inizia a leggere immediatamente i libri Kindle sul tuo smartphone, tablet o computer, senza bisogno di un dispositivo Kindle.

Leggi immediatamente sul browser con Kindle per il Web.

Con la fotocamera del cellulare scansiona il codice di seguito e scarica l'app Kindle.

Codice QR per scaricare l'app Kindle

Segui l'autore

Donald E. Knuth
Segui
Si è verificato un errore. Riprova a effettuare la richiesta più tardi.

The Art of Computer Programming: Sorting and Searching: Sorting and Searching, Volume 3 Copertina rigida – 23 giugno 1998

Edizione Inglese di Donald E. Knuth (Autore)
4,7 su 5 stelle 61 voti

The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming.

–Byte, September 1995

I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasn't in the line-up.

–Charles Long

If you think you're a really good programmer... read [Knuth's] Art of Computer Programming... You should definitely send me a resume if you can read the whole thing.

–Bill Gates

It's always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers.

–Jonathan Laventhol

The first revision of this third volume is the most comprehensive survey of classical computer techniques for sorting and searching. It extends the treatment of data structures in Volume 1 to consider both large and small databases and internal and external memories. The book contains a selection of carefully checked computer methods, with a quantitative analysis of their efficiency. Outstanding features of the second edition include a revised section on optimum sorting and new discussions of the theory of permutations and of universal hashing.


Ebook (PDF version) produced by Mathematical Sciences Publishers (MSP),http://msp.org

Leggi di più
Diapositiva precedente dei dettagli del prodotto
  1. ISBN-10
    0201896850
  2. ISBN-13
    978-0201896855
  3. Edizione
    Subsequent
  4. Editore
    Addison-Wesley Professional
  5. Data di pubblicazione
    23 giugno 1998
  6. Parte della serie
    The Art of Computer Programming
  7. Lingua
    Inglese
  8. Dimensioni
    24.1 x 16.89 x 4.34 cm
  9. Lunghezza stampa
    780 pagine
Diapositiva successiva dei dettagli del prodotto

Descrizione prodotto

Dalla quarta di copertina

The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming.

—Byte, September 1995

I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasn't in the line-up.

—Charles Long

If you think you're a really good programmer... read [Knuth's] Art of Computer Programming... You should definitely send me a resume if you can read the whole thing.

—Bill Gates

It's always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers.

—Jonathan Laventhol

The first revision of this third volume is the most comprehensive survey of classical computer techniques for sorting and searching. It extends the treatment of data structures in Volume 1 to consider both large and small databases and internal and external memories. The book contains a selection of carefully checked computer methods, with a quantitative analysis of their efficiency. Outstanding features of the second edition include a revised section on optimum sorting and new discussions of the theory of permutations and of universal hashing.



L'autore

Donald E. Knuth is known throughout the world for his pioneering work on algorithms and programming techniques, for his invention of the Tex and Metafont systems for computer typesetting, and for his prolific and influential writing. Professor Emeritus of The Art of Computer Programming at Stanford University, he currently devotes full time to the completion of these fascicles and the seven volumes to which they belong.

Dettagli prodotto

  • Editore ‏ : ‎ Addison-Wesley Professional
  • Data di pubblicazione ‏ : ‎ 23 giugno 1998
  • Edizione ‏ : ‎ Subsequent
  • Lingua ‏ : ‎ Inglese
  • Lunghezza stampa ‏ : ‎ 780 pagine
  • ISBN-10 ‏ : ‎ 0201896850
  • ISBN-13 ‏ : ‎ 978-0201896855
  • Peso articolo ‏ : ‎ 1,32 Kilograms
  • Dimensioni ‏ : ‎ 24.1 x 16.89 x 4.34 cm
  • Parte della serie ‏ : ‎ The Art of Computer Programming
  • Recensioni dei clienti:
    4,7 su 5 stelle 61 voti

Informazioni sull'autore

Segui gli autori per ottenere aggiornamenti sulle nuove uscite, oltre a consigli avanzati.
Donald E. Knuth

Donald E. Knuth

Brief content visible, double tap to read full content.
Full content visible, double tap to read brief content.

Scopri altri libri dell'autore, vedi autori simili, leggi i consigli sui libri e altro ancora.

Recensioni clienti

4,7 su 5 stelle
61 valutazioni globali

Recensisci questo prodotto

Condividi i tuoi pensieri con altri clienti
Scrivi una recensione cliente

Recensioni migliori da Italia

  • Luigi
    5,0 su 5 stelle Benissimo
    Recensito in Italia il 5 febbraio 2020
    Formato: Copertina rigidaAcquisto verificato
    Volume in ottime condizioni. Recapitato nei tempi previsti.
    Utile
     Segnala

Le recensioni migliori da altri paesi

Traduci tutte le recensioni in Italiano
  • wiredweird
    5,0 su 5 stelle What's old is new again
    Recensito negli Stati Uniti il 4 novembre 2006
    Formato: Copertina rigidaAcquisto verificato
    First the basics: it's great, it provides wide-ranging and deep analysis, it shows many views and variants of each problem, and its bibliography is helpful, though not exhaustive. The historical notes, including sorts for drum storage, may seem quaint to modern readers. And sorting has been done, right? You just run a shell program or call a function, and tap into the best technology. Does it need to be done again?

    Yes, if you're on the edge of technology, it does need to be done again, and again, and again. That's because technology keeps expanding, and violating old assumptions as it does. Memories got big enough that the million-record sort is now a yawn, where it used to be a journal article. But, at the same time, processor clocks got 100-1000x ahead of memory speeds. All of a sudden, those drum-based algorithms are worth another look, because yesteryear's drum:memory ratios are a lot like today's memory:cache ratios of size and speed - and who doesn't want a 100x speedup? Parallel processing is moving from the supercomputing elite into laptops, causing more tremors in the ground rules. GPU and reconfigurable computing also open whole new realms of pitfalls as well as opportunities.

    Knuth points out that the analyses have beauty in themselves, for people with eyes to see it. His analyses also demonstrate techniques applicable way beyond the immediate discussion, too. Today, though, I have nasty problems in technologies that no one really knows how to handle very well. I have to go back and check all the assumptions again, since so many of them changed. If that's the kind of problem you have, too, then this is the place to start.

    //wiredweird
    Segnala
  • Kan-Hua Lee
    5,0 su 5 stelle The book is of course a classic. The physical condition of the book is good
    Recensito in Giappone il 15 gennaio 2023
    Formato: Copertina rigidaAcquisto verificato
     
    Immagine cliente
    Kan-Hua Lee
    5,0 su 5 stelle
    The book is of course a classic. The physical condition of the book is good

    Recensito in Giappone il 15 gennaio 2023

    Immagini presenti nella recensione
    Immagine clienteImmagine cliente
    Segnala
  • Amazon Customer
    1,0 su 5 stelle One Star
    Recensito in India il 18 luglio 2018
    Acquisto verificato
    Blanket with spot have been received
    Segnala
  • Josh Berry
    5,0 su 5 stelle More approachable than you probably think. Try it.
    Recensito negli Stati Uniti il 23 ottobre 2014
    Formato: Formato KindleAcquisto verificato
    I can not make the claim that I have fully worked the exercises. Indeed, I have sadly barely touched them. However, I do feel like I learned something from this book every time I picked it up.

    The writing style remains much more approachable than you probably think it is. Specifically, even the heavy math sections are fun to read through as an interested programmer. Sure, it is intimidating in that I don't think I fully followed the thought process on many sections on my first read through. However, coming back and trying multiple times usually left me feeling like I at least understood what was being discussed. Even if I'm not quite sure, yet, that I could have hit on some of these ideas myself.

    The section at the end on searching on secondary keys is a true delight. Just plain fun to consider the different tricks that can be done with data.
    Segnala
  • Some what high
    5,0 su 5 stelle It served its purpose
    Recensito negli Stati Uniti il 18 febbraio 2014
    Formato: Copertina rigidaAcquisto verificato
    This was a gift and the recipient loved it. It came in with excellent condition and arrived in time. BTW the recipient has a job related to the content of the book and hopefully this book had some positive effects.
    Segnala