Mastering Algorithms with C: Useful Techniques from Sorting to Encryption By Kyle Loudon, Andy Oram ISBN: 9781565924536 UPC: 636920924531 ASIN: B0043EWV5Q Published: 1999 Number of Pages: 562 Binding: Paperback

Pricing & Availability: Additional Details: Product Type: Book Publisher: O'Reilly Media Description: Written with the intermediate to advanced C programmer in mind, Mastering Algorithms with C delivers a no-nonsense guide to the most common algorithms needed by real-world developers. The highlight of the book has to be its concise and readable C functions for all the algorithms presented here, including basics like linked lists, stacks to trees, graphs, and sorting/searching algorithms. The C functions that implement these algorithms are clearly printed and remarkably easy to read. You can use this sample code directly or adapt it into your C/C++ code. Although mathematical concepts like Big-O notation are discussed, the authors don't get bogged down in the computer science theory surrounding algorithms. Instead, they present the most tried-and-true algorithms available today in an efficient format. Besides introducing each algorithm, they describe how each is used in computing today, along with a short demo application. Some of these samples are quite low-level, such as a virtual memory manager implemented with linked lists. Most examples are more of general interest, such as a graphing example that counts network hops. Each section ends with questions and answers about how the algorithms work, along with references to other algorithms (both in the book and from other sources). The authors concentrate on the most useful algorithms available today and don't try to cover every available variation. Busy readers will appreciate the intelligent selection--and efficient presentation--used here. There are a number of books on C algorithms, but Master Algorithms with C is one of the most concise and immediately useful. It's a perfect choice for the working C/C++ programmer who's in a hurry to find just the right algorithm for writing real-world code. --Richard Dragan Topics covered: Algorithm efficiency, pointer basics, arrays, recursion, Big-O Notation, linked lists, stacks, queues, sets, hash tables, trees and B-trees, searching, heaps and priority queues, graphs, sorting and searching algorithms, numerical methods, data compression, Huffman coding, LZ77, data encryption, DES, RSA, graph algorithms, minimum spanning trees, geometric algorithms, and convex hulls.

Fixed-Length Data Elements - Additional Material Characteristics: m d : m m

Library of Congress Control Number
   - LC control Number:  00268032
   - LC control Number: 00268032

National Bibliography Number
   - Source: bnb: GB9966887: GB99-66887

International Standard Book Number: 1565924533

Library of Congress Call Number
   - Classification number: QA76.73.C15
   - Item number: L68 1999

Classification Numbers Assigned in Canada
   - Classification number: QA76.73.C15
   - Item number: L68 1999

Dewey Decimal Classification Number
   - Edition number: 21
   - Classification number: 005.13/3

Main Entry - Personal Name
   - Personal name: Loudon, Kyle
   - Personal name: Loudon, Kyle.

Title Statement
   - Title: Mastering algorithms with C
   - Title: Mastering algorithms with C /
   - Statement of responsibility, etc.: Kyle Loudon
   - Statement of responsibility, etc.: Kyle Loudon.
   - Medium: [electronic resource] /

Edition Statement: 1st ed: 1st ed.

Publication, Distribution, etc. (Imprint)
   - Place of publication, distribution, etc.: Beijing :
   - Place of publication, distribution, etc.: Beijing ;
   - Place of publication, distribution, etc.: Farnham :
   - Place of publication, distribution, etc.: Sebastopol, CA :
   - Name of publisher, distribution, etc.: O'Reilly,
   - Name of publisher, distribution, etc.: Sebastopol, CA :
   - Date of publication, distribution, etc.: 1999
   - Date of publication, distribution, etc.: 1999.
   - Date of publication, distribution, etc.: c1999.

Physical Description
   - Extent: xvii, 540 p. :
   - Extent: xvii,540 p. :
   - Other physical details: ill. ;
   - Dimensions: 24 cm
   - Dimensions: 24 cm +
   - Dimensions: 24 cm. +
   - Accompanying material: 1 computer disk
   - Accompanying material: 1 computer disk (3 1/2 in.)

Series Statement/Added Entry - Title: Nutshell handbook

General Note: "Useful techniques from sorting to encryption"--Cover: "Useful techniques from sorting to encryption"--Cover.: "Useful techniques from sorting to encryption'--Cover.: Accompanied by a computer disk.: Additional title on front cover: Useful techniques from sorting to encryption.: Includes index: Includes index.

Reproduction Note
   - Type of reproduction: Electronic reproduction.
   - Place of reproduction: Boston, MA :
   - Agency responsible for reproduction: Safari Tech Books Online,
   - Date of reproduction: [200-].
   - Note about reproduction: Available to subscribing institutions
   - Note about reproduction: Mode of access: World Wide Web.

Local Notes: COMPUTER DISK AVAILABLE AT THE CIRCULATION DESK.

Subject Added Entry - Uniform Title
   - Uniform title: Microsoft C.

Subject Added Entry - Topical Term
   - Topical term or geographic name entry element: Algorithms.
   - Topical term or geographic name entry element: C (Computer program language)
   - Topical term or geographic name entry element: C (Computer program language).
   - Topical term or geographic name entry element: Computer algorithms
   - Topical term or geographic name entry element: Computer algorithms.
   - Topical term or geographic name entry element: Data structures (Computer science)
   - Topical term or geographic name entry element: Data structures (Computer science).

Added Entry - Corporate Name
   - Corporate name or jurisdiction name as entry element: Safari Tech Books Online

Additional Physical Form Entry
   - Qualifying information: Original
   - Record control number: (DLC) 00268032
   - Record control number: (OCoLC)42291283
   - International Standard Book Number: 1565924533