Practical Algorithms for Programmers: Andrew Binstock, John Rex: 9780201632088: Englische Bücher

Hinweise und Aktionen

Valentinstags-Special: Zusätzlich zu Ihrem Amazon-Einkauf jetzt das Album Classical Music from Romantic Movies für nur 1 EUR herunterladen. Alle Infos zur Aktion.

Mehr �ber den Autor

Entdecken Sie B�cher, lesen Sie �ber Autoren und mehr

› Besuchen Sie die Seite von Andrew Binstock auf Amazon

Produktbeschreibungen

Kurzbeschreibung

Most algorithm books today are either academic textbooks or rehashes of the same tired set of algorithms. Practical Algorithms for Programmers is the first book to give complete code implementations of all algorithms useful to developers in their daily work. This book focuses on practical, immediately usable code with extensive discussion of portability and implementation-specific details. The authors present the useful but rarely discussed algorithms for phonetic searches, date and time routines (to the year AD 1), B-trees and indexed files, data compression, arbitrary precision arithmetic, checksums and data validation, as well as the most comprehensive coverage available of search routines, sort algorithms, and data structures. Practical Algorithms for Programmers requires only a working knowledge of C and no math beyond basic algebra. The source code is ANSI-compliant and has been tested and run on compilers from Borland, Microsoft, Watcom, and UNIX. 020163208XB04062001

Synopsis

Most algorithm books today are either academic textbooks or rehashes of the same tired set of algorithms. Practical Algorithms for Programmers is the first book to give complete code implementations of all algorithms useful to developers in their daily work. This book focuses on practical, immediately usable code with extensive discussion of portability and implementation-specific details. The authors present the useful but rarely discussed algorithms for phonetic searches, date and time routines (to the year AD 1), B-trees and indexed files, data compression, arbitrary precision arithmetic, checksums and data validation, as well as the most comprehensive coverage available of search routines, sort algorithms, and data structures. Practical Algorithms for Programmers requires only a working knowledge of C and no math beyond basic algebra. The source code is ANSI-compliant and has been tested and run on compilers from Borland, Microsoft, Watcom, and UNIX. 020163208XB04062001

Alle Produktbeschreibungen

Eine digitale Version dieses Buchs im Kindle-Shop verkaufen

Wenn Sie ein Verleger oder Autor sind und die digitalen Rechte an einem Buch haben, k�nnen Sie die digitale Version des Buchs in unserem Kindle-Shop verkaufen. Weitere Informationen

Kundenrezensionen

9 Rezensionen

5 Sterne:		(4)
4 Sterne:		(1)
3 Sterne:		(2)
2 Sterne:		(0)
1 Sterne:		(2)

Durchschnittliche Kundenbewertung

3.6 von 5 Sternen (9 Kundenrezensionen)

Sagen Sie Ihre Meinung zu diesem Artikel:

Eigene Rezension erstellen

Die hilfreichsten Kundenrezensionen

5.0 von 5 Sternen Think of this book as CS Cliff's Notes., 10. Juni 2000

Von

J. D. Mayo (San Jose, CA United States) - Alle meine Rezensionen ansehen
(REAL NAME)

Rezension bezieht sich auf: Practical Algorithms for Programmers (Taschenbuch)

The english in this book is very clear (to me), and the explainations are short and to the point. I personally have a very short attention span, so reading many paragraphs of stuffy technical descriptions found in other books is nearly impossible for me to bear. The book goes over linked lists, binary trees, red/black trees, b-trees, hash tables, gregorian&julian date/time conversion, Chksums&CRCs, compression(LZ,huffman,LZW). The book is excellent for anyone having trouble understanding this type of material in a CS course, think of this book as CS Cliff's Notes. The copy I own would be on my desk at all times, except that it gets borrowed so much that I rarely know who in the company has it. My cover is nearly falling off and the corners are all bend up from the large amount of use that this book gets.

Helfen Sie anderen Kunden bei der Suche nach den hilfreichsten Rezensionen

War diese Rezension f�r Sie hilfreich? Ja Nein

Missbrauch melden | Kommentar als Link

Kommentar Kommentar

5.0 von 5 Sternen This of this book as CS Cliff's Notes., 10. Juni 2000

Von

J. D. Mayo (San Jose, CA United States) - Alle meine Rezensionen ansehen
(REAL NAME)

Rezension bezieht sich auf: Practical Algorithms for Programmers (Taschenbuch)

The english in this book is very clear (to me), and the explainations are short and to the point. I personally have a very short attention span, so reading many paragraphs of stuffy technical descriptions found in other books is nearly impossible for me to bear. The book goes over linked lists, binary trees, red/black trees, b-trees, hash tables, gregorian&julian date/time conversion, Chksums&CRCs, compression(LZ,huffman,LZW). The book is excellent for anyone having trouble understanding this type of material in a CS course, think of this book as CS Cliff's Notes. The copy I own would be on my desk at all times, except that it gets borrowed so much that I rarely know who in the company has it. My cover is nearly falling off and the corners are all bend up from the large amount of use that this book gets.

Helfen Sie anderen Kunden bei der Suche nach den hilfreichsten Rezensionen

War diese Rezension f�r Sie hilfreich? Ja Nein

Missbrauch melden | Kommentar als Link

Kommentar Kommentar

4.0 von 5 Sternen Great! But there is a bug on source code. Watch out !, 18. Mai 2000

Von

J. S. Shin (Seoul, South Korea) - Alle meine Rezensionen ansehen
(REAL NAME)

Rezension bezieht sich auf: Practical Algorithms for Programmers (Taschenbuch)

Great book! Many practical algorithms are there. :) But also there is a practical bug on source code. For example, Ch 4,boyermor.c, listing 4-3 : Line 73:

memset( CharJump, 0, Alphabetsize * sizeof(unsigned) );

It should be as follows:

memset( CharJump, PatLen, Alphabetsize * sizeof (unsigned) );

This is a minor bug. But it can slow down boyer-moore searching speed. It's hard to be detected by empirical debugging. There is no bug in algorithm explanation. So,do not 100% rely on source code example. Read explanation, then apply example source code to your own source.

Helfen Sie anderen Kunden bei der Suche nach den hilfreichsten Rezensionen

War diese Rezension f�r Sie hilfreich? Ja Nein

Missbrauch melden | Kommentar als Link

Kommentar Kommentar

Sagen Sie Ihre Meinung zu diesem Artikel: Eigene Rezension erstellen

› Alle 9 Kundenrezensionen anzeigen...

Die neuesten Kundenrezensionen

5.0 von 5 Sternen Great Book
If you want to learn how to implement the LZW algorithm in your code, or do other commmon algorithms in C this book is for you. I found it very useful. Lesen Sie weiter...

Am 28. August 1999 ver�ffentlicht

1.0 von 5 Sternen Do not buy this book.
The text of the book does an adequate job of describing the basic algorithms. However, the source code examples are sprinkled with C intricacies and complexities that cloud the... Lesen Sie weiter...

Am 3. August 1999 ver�ffentlicht

3.0 von 5 Sternen Very interesting material - lousy quality control
As someone who is trying to learn how to program on their own, the hardest thing to find is practical examples of how things might be done. Lesen Sie weiter...