Mastering Algorithms with C

( 4 )

Overview

There are many books on data structures and algorithms, including some with useful libraries of C functions. Mastering Algorithms with C offers you a unique combination of theoretical background and working code. With robust solutions for everyday programming tasks, this book avoids the abstract style of most classic data structures and algorithms texts, but still provides all of the information you need to understand the purpose and use of common programming techniques.

...

See more details below
Paperback
$33.29
BN.com price
(Save 26%)$44.99 List Price

Pick Up In Store

Reserve and pick up in 60 minutes at your local store

Other sellers (Paperback)
  • All (26) from $3.55   
  • New (14) from $22.07   
  • Used (12) from $3.55   
Mastering Algorithms with C

Available on NOOK devices and apps  
  • NOOK Devices
  • Samsung Galaxy Tab 4 NOOK
  • NOOK HD/HD+ Tablet
  • NOOK
  • NOOK Color
  • NOOK Tablet
  • Tablet/Phone
  • NOOK for Windows 8 Tablet
  • NOOK for iOS
  • NOOK for Android
  • NOOK Kids for iPad
  • PC/Mac
  • NOOK for Windows 8
  • NOOK for PC
  • NOOK for Mac
  • NOOK for Web

Want a NOOK? Explore Now

NOOK Book (eBook)
$19.99
BN.com price
(Save 44%)$35.99 List Price

Overview

There are many books on data structures and algorithms, including some with useful libraries of C functions. Mastering Algorithms with C offers you a unique combination of theoretical background and working code. With robust solutions for everyday programming tasks, this book avoids the abstract style of most classic data structures and algorithms texts, but still provides all of the information you need to understand the purpose and use of common programming techniques.

Implementations, as well as interesting, real-world examples of each data structure and algorithm, are included.

Using both a programming style and a writing style that are exceptionally clean, Kyle Loudon shows you how to use such essential data structures as lists, stacks, queues, sets, trees, heaps, priority queues, and graphs. He explains how to use algorithms for sorting, searching, numerical analysis, data compression, data encryption, common graph problems, and computational geometry. And he describes the relative efficiency of all implementations. The compression and encryption chapters not only give you working code for reasonably efficient solutions, they offer explanations of concepts in an approachable manner for people who never have had the time or expertise to study them in depth.

Anyone with a basic understanding of the C language can use this book. In order to provide maintainable and extendible code, an extra level of abstraction (such as pointers to functions) is used in examples where appropriate. Understanding that these techniques may be unfamiliar to some programmers, Loudon explains them clearly in the introductory chapters.

Contents include:

  • Pointers
  • Recursion
  • Analysis of algorithms
  • Data structures (lists, stacks, queues, sets, hash tables, trees, heaps, priority queues, graphs)
  • Sorting and searching
  • Numerical methods
  • Data compression
  • Data encryption
  • Graph algorithms
  • Geometric algorithms

For anyone with a basic understanding of C, the robust solutions found here will offer help for everyday programming tasks, providing all the necessary information to understand and us common techniques. Includes implementations and real-world examples of each data structure in the text, and full-source code on the accompanying disk.

Read More Show Less

Editorial Reviews

Library Journal
Although older than some of the current languages, C still is one of the best general purpose programming languages around. Loudon's book discusses C pointers, recursion, data structures from lists and stacks to trees and graphs, sorting and searching, and encryption. This is not a beginner's manual but will work well for programmers wanting to refresh their C techniques and for those moving from another language to C. Copyright 1999 Cahners Business Information.
Read More Show Less

Product Details

  • ISBN-13: 9781565924536
  • Publisher: O'Reilly Media, Incorporated
  • Publication date: 8/12/1999
  • Series: Mastering Series
  • Edition number: 1
  • Pages: 562
  • Sales rank: 787,388
  • Product dimensions: 6.99 (w) x 9.99 (h) x 1.17 (d)

Meet the Author

Kyle Loudon is a software engineer at Matrix Semiconductor in Santa Clara, California, where he works with file systems and applications for memory chips. Prior to Matrix, Kyle developed platform software for embedded devices, including various wireless phones and the Apple iPod. He also led the graphical user interface group at Jeppesen Dataplan (now a part of Boeing), developed flight planning software, and created system software at IBM in the early 1990s. For the past several years, Kyle has taught object-oriented programming using C++ at the University of California, Santa Cruz Extension, and has worked with C++ since the beginning of its widespread use in 1990. Kyle is the author of Mastering Algorithms with C, also published by O'Reilly and Associates.

Read More Show Less

Table of Contents

Preface

Part I: Preliminaries

Chapter 1: Introduction

Chapter 2: Pointer Manipulation

Chapter 3: Recursion

Chapter 4: Analysis of Algorithms

Part II: Data Structures

Chapter 5: Linked Lists

Chapter 6: Stacks and Queues

Chapter 7: Sets

Chapter 8: Hash Tables

Chapter 9: Trees

Chapter 10: Heaps and Priority Queues

Chapter 11: Graphs

Part III: Algorithms

Chapter 12: Sorting and Searching

Chapter 13: Numerical Methods

Chapter 14: Data Compression

Chapter 15: Data Encryption

Chapter 16: Graph Algorithms

Chapter 17: Geometric Algorithms

Colophon

Read More Show Less

Customer Reviews

Average Rating 3
( 4 )
Rating Distribution

5 Star

(1)

4 Star

(1)

3 Star

(0)

2 Star

(0)

1 Star

(2)

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
Sort by: Showing all of 4 Customer Reviews
  • Anonymous

    Posted November 29, 2003

    A very nice book.

    I found this book to be very nice. It gives a great introduction to data structures using the C language. It also gives some great intro. details to some topics used throughout the book, like recursion, O-notation, and how to analyze the efficiancy of your algorithm. Something not stressed enough these days, IMO. It does an excellent job of exploring the theory, and details behind each type of data structure, then continues on to a very concise example of it in action. It does a great job of breaking down every function and actually explaining what every function is going to do. It tells you exactly what role it plays in the entire data structure, very nice to have. The code is very easy to understand. Each function is kept to a minimum, and things are logically organized, and broken up. Very nice to see that. My only problem with the book is the accompanying disk was a diskette. I don't know about anyone else, but for me they have a short shelf life. I was able to get the contents, but now the diskette is basically broken. Would have been great to get that on a little more trustworthy medium such as CD (However Oreilly.com offers zip\.tar.gz files of the examples. So not all is lost, that is mighty cool of them). This book definitely assumes a good deal of knowledge in the C language. I would recommend one learn minimally basic functions, pointers, function pointers, dynamic memory allocation\deallocation, your basic if\else statements, looping, etc... before trying to read this. It would be possible, but i'm sure more frustrating then need be. If you don't understand those things most of the example code will be very hard to understand. Other then that if you're looking for a great introduction book, and something to hold on to for a great reference, this is it. All around good book. Hope it helps someone...

    1 out of 1 people found this review helpful.

    Was this review helpful? Yes  No   Report this review
  • Posted August 14, 2011

    Sample does not open.

    .....

    Was this review helpful? Yes  No   Report this review
  • Anonymous

    Posted October 25, 2000

    most Oreilly books are usually pretty good but.

    I found this book to have an ambiguous presentation. The examples are vague and strange. Most of them abuse the use of the preprocessor so much that its hard to exactly tell what is going on in the code. It is not that i think useing macro's are bad its just that there are so many of them and well, people buy books for clarity. If i wanted to see a the best linked list some one could write I could find plenty of examples on the net. This code reminds me of the obfuscated code you see in some contests.

    Was this review helpful? Yes  No   Report this review
  • Anonymous

    Posted July 4, 2011

    No text was provided for this review.

Sort by: Showing all of 4 Customer Reviews

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