Practical Algorithms for Programmers / Edition 1

Paperback (Print)
Used and New from Other Sellers
Used and New from Other Sellers
from $1.99
Usually ships in 1-2 business days
(Save 95%)
Other sellers (Paperback)
  • All (19) from $1.99   
  • New (3) from $26.77   
  • Used (16) from $1.99   

Overview

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

The first book to provide a comprehensive, nonacademic treatment of the algorithms commonly used in advanced application development. The authors provide a wide selection of algorithms fully implemented in C with substantial practical discussion of their best use in a variety of applications.

Read More Show Less

Editorial Reviews

Booknews
A compendium of immediately usable code implementations for algorithms that software developers use often. They include such tasks as phonetic searches, time and date routines, b-trees and indexed files, and data compression and validation. Assumes only a working knowledge of C and basic algebra. The source code is ANSI compliant and has been tested on all the popular compilers. Annotation c. Book News, Inc., Portland, OR (booknews.com)
Read More Show Less

Product Details

  • ISBN-13: 9780201632088
  • Publisher: Addison-Wesley
  • Publication date: 6/9/1995
  • Edition number: 1
  • Pages: 592
  • Product dimensions: 7.40 (w) x 9.10 (h) x 1.20 (d)

Meet the Author

Andrew Binstock is editor-in-chief of UNIX Review and founding editor of the C Gazette. He was the lead author of HP LaserJet Programming (Addison-Wesley, 1991).

John Rex is a computer consultant specializing in C and C++. He is the former technical editor of the C Gazette and has written articles for numerous magazines.

020163208XAB04062001

Read More Show Less

Table of Contents

Preface
Ch. 1 Introduction 1
Ch. 2 Basic Data Structures 13
Ch. 3 Hashing 63
Ch. 4 Searching 95
Ch. 5 Sorting 173
Ch. 6 Trees 245
Ch. 7 Date and Time 363
Ch. 8 Arbitrary-Precision Arithmetic 393
Ch. 9 Data Compression 467
Ch. 10 Data Integrity and Validation 535
Index 571
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)