Murakami Sale
 
 

Recently Viewed clear list


Q&A | August 19, 2014

Richard Kadrey: IMG Powell’s Q&A: Richard Kadrey



Describe your latest book. The Getaway God is the sixth book in the Sandman Slim series. In it, the very unholy nephilim, James Stark, aka Sandman... Continue »
  1. $17.49 Sale Hardcover add to wish list

spacer

On Order

$72.50
New Hardcover
Currently out of stock.
Add to Wishlist
available for shipping or prepaid pickup only
Qty Store Section
- Local Warehouse Software Engineering- Programming and Languages

Other titles in the Addison-Wesley Series in Computer Science series:

Algorithims in C (Addison-Wesley Series in Computer Science)

by

Algorithims in C (Addison-Wesley Series in Computer Science) Cover

 

Synopses & Reviews

Publisher Comments:

"This is an eminently readable book which an ordinary programmer, unskilled in mathematical analysis and wary of theoretical algorithms, ought to be able to pick up and get a lot out of.."

- Steve Summit, author of C Programming FAQs

Sedgewick has a real gift for explaining concepts in a way that makes them easy to understand. The use of real programs in page-size (or less) chunks that can be easily understood is a real plus. The figures, programs, and tables are a significant contribution to the learning experience of the reader; they make this book distinctive.

- William A. Ward, University of South Alabama

Robert Sedgewick has thoroughly rewritten and substantially expanded his popular work to provide current and comprehensive coverage of important algorithms and data structures. Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 250,000 programmers!

This particular book, Parts 1-4, represents the essential first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. The algorithms and data structures are expressed in concise implementations in C, so that you can both appreciate their fundamental properties and test them on real applications. Of course, the substance of the book applies to programming in any language.Highlights

  • Expanded coverage of arrays, linked lists, strings, trees, and other basic data structures
  • Greater emphasis on abstract data types (ADTs) than in previous editions
  • Over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations
  • New implementations of binomial queues, multiway radix sorting, Batcher's sorting networks, randomized BSTs, splay trees, skip lists, multiway tries, and much more
  • Increased quantitative information about the algorithms, including extensive empirical studies and basic analytic studies, giving you a basis for comparing them
  • Over 1000 new exercises to help you learn the properties of algorithms

Whether you are a student learning the algorithms for the first time or a professional interested in having up-to-date reference material, you will find a wealth of useful information in this book.

Book News Annotation:

All of the original algorithms written in Pascal in Algorithms are implemented in the C language. Describes a variety of algorithms in each of a number of areas: sorting, searching, string-processing, geometric, graph and mathematics.
Annotation c. Book News, Inc., Portland, OR (booknews.com)

Synopsis:

Sedgewick's bestselling book, Algorithms, is now available for C programmers. Algorithms in C describes a variety of algorithms in a number of areas of interest, including: sorting, searching, string-processing, and geometric, graph and mathematical algorithms. The book emphasizes fundamental techniques, providing readers with the tools to confidently implement, run, and debug useful algorithms.

Synopsis:

This new version of the best-selling book, Algorithms, SecondEdition, provides a comprehensive collection of algorithmsimplemented in C. A variety of algorithms are described in eachofthe following areas: sorting, searching, string-processing,geometric, graph, and mathematical algorithms. These algorithmsare expressed in terms of concise implementations in C, so thatreaders can both appreciate their fundamental properties and testthem on real applications.

The treatment of analysis of algorithms is carefully developed. When appropriate, analytic results are discussed to illustratewhy certain algorithms are preferred, and in some cases, therelationship of the practical algorithms being disussed to purelytheoretical results is also described.Features

  • Hundreds of detailed, innovative figures clearly demonstratehow important algorithms work.
  • Throughout the book, "properties" sections encapsulatespecific information on the performance characteristics ofalgorithms.
  • Six chapters present fundamental concepts, including a briefintroduction to data structures.

Algorithms in C provides readers with the tools to confidentlyimplement, run, and debug useful algorithms. This book may beuseful for self-study, or as a reference for people engaged inthe development of computer systems for applications programs.

0201514257B04062001

About the Author

Robert Sedgewick is the William O. Baker Professor of Computer Science at Princeton University. He is a Director of Adobe Systems and has served on the research staffs at Xerox PARC, IDA, and INRIA. He earned his Ph.D from Stanford University under Donald E. Knuth.

0201514257AB06262002

Table of Contents

I. FUNDAMENTALS.
1. Introduction.

Algorithms.

Outline of Topics.
2. C.

Example: Euclid’s Algorithm.

Types of Data.

Input/Output.

Concluding Remarks.
3. Elementary Data Structures.

Arrays.

Linked Lists.

Storage Allocation.

Pushdown Stacks.

Queues.

Abstract Data Types.
4. Trees.

Glossary.

Properties.

Representing Binary Trees.

Representing Forests.

Traversing Trees.
5. Recursion.

Recurrences.

Divide-and-Conquer.

Recursive Tree Traversal.

Removing Recursion.

Perspective.
6. Analysis of Algorithms.

Framework.

Classification of Algorithms.

Computational Complexity.

Average-Case Analysis.

Approximate and Asymptotic Results.

Basic Recurrences.

Perspective.
7. Implementation of Algorithms.

Selecting an Algorithm.

Empirical Analysis.

Program Optimization.

Algorithms and Systems.

II. SORTING ALGORITHMS.

8. Elementary Sorting Methods.

Rules of the Game.

Selection Sort.

Insertion Sort.

Digression: Bubble Sort.

Performance Characteristics of Elementary Sorts.

Sorting Files with Large Records.

Shellsort.

Distribution Counting.
9. Quicksort.

The Basic Algorithm.

Performance Characteristics of Quicksort.

Removing Recursion.

Small Subfiles.

Median-of-Three Partitioning.

Selection.
10. Radix Sorting.

Bits.

Radix Exchange Sort.

Straight Radix Sort.

Performance Characteristics of Radix Sorts.

A Linear Sort.
11. Priority Queues.

Elementary Implementations.

Heap Data Structure.

Algorithms on Heaps.

Heapsort.

Indirect Heaps.

Advanced Implementations.
12. Mergesort.

Merging.

Mergesort.

List Mergesort.

Bottom-up Mergesort.

Performance Characteristics.

Optimized Implementations.

Recursion Revisited.
13. External Sorting.

Sort-Merge.

Balanced Multiway Merging.

Replacement Selection.

Practical Considerations.

Polyphase Merging.

An Easier Way.

III. SEARCHING ALGORITHMS.

14. Elementary Searching Methods.

Sequential Searching.

Binary Search.

Binary Tree Search.

Deletion.

Indirect Binary Search Trees.
15. Balanced Trees.

Top-Down 2-3-4 Trees.

Red-Black Trees.

Other Algorithms.
16. Hashing.

Hash Functions.

Separate Chaining.

Linear Probing.

Double Hashing.

Perspective.
17. Radix Searching.

Digital Search Trees.

Radix Search Tries.

Multiway Radix Searching.

Patricia.
18. External Searching.

Indexed Sequential Access.

B-Trees.

Extendible Hashing.

Virtual Memory.

IV. STRING PROCESSING.

19. String Searching.

A Short History.

Brute-Force Algorithm.

Knuth-Morris-Pratt Algorithm.

Boyer-Moore Algorithm.

Rabin-Karp Algorithm.

Multiple Searches.
20. Pattern Matching.

Describe Patterns.

Pattern Matching Machines.

Representing the Machine.

Simulating the Machine.
21. Parsing.

Context-Free Grammars.

Top-Down Parsing.

Bottom-Up Parsing.

Compilers.

Compiler-Compilers.
22. File Compression.

Run-Length Encoding.

Variable-Length Encoding.

Building the Huffman Code.

Implementation.
23. Cryptology.

Rules of Game.

Simple Methods.

Encryption/Decryption Machines.

Public-Key Cryptosystems.

V. GEOMETRIC ALGORITHMS.

24. Elementary Geometric Methods.

Points, Lines, and Polygons.

Line Segment Intersection.

Simple Closed Path.

Inclusion in a Polygon.

Perspective.
25. Finding the Convex Hull.

Rules of the Game.

Package-Wrapping.

The Graham Scan.

Interior Elimination.

Performance Issues.
26. Range Searching.

Elementary Methods.

Grid Method.

Two-Dimensional Trees.

Multidimensional Range Searching.
27. Geometric Intersection.

Horizontal and Vertical Lines.

Implementation.

General Line Intersection
28. Closest-Point Problems.

Closest-Pair Problem.

Voronoi Diagrams.

VI. GRAPH ALGORITHMS.

29. Elementary Graph Algorithms.

Glossary.

Representation.

Depth-First Search.

Nonrecursive Depth-First Search.

Breadth-First Search.

Mazes.

Perspective.
30. Connectivity.

Connected Components.

Biconnectivity.

Union-Find Algorithms.
31. Weighted Graphs

Minimum Spanning Tree.

Priority-First Search.

Kruskal’s Method.

Shortest Path.

Minimum Spanning Tree and Shortest Paths in Dense Graphs.

Geometric Problems.
32. Network Flow.

The Network Flow Problem.

Ford-Fulkerson Method.

Network Searching.
33. Matching.

Bipartite Graphs.

Stable Marriage Problem.

Advanced Algorithms.

VII. MATHEMATICAL ALGORITHMS.

34. Random Numbers.

Applications.

Linear Congruential Method.

Additive Congruential Method.

Testing Randomness.

Implementation Notes.
35. Arithmetic.

Polynomial Arithmetic.

Polynomial Evaluation and Interpolation.

Polynomial Multiplication.

Arithmetic Operations with Large Integers.

Matrix Arithmetic.
36. Gaussian Elimination.

A Simple Example.

Outline of the Method.

Variations and Extensions.
37. Curve Fitting.

Polynomial Interpolation.

Spline Interpolation.

Method of Least Squares.
38. Integration.

Symbolic Integration.

Simple Quadrature Methods.

Compound Methods.

Adaptive Quadrature.

VIII. ADVANCED TOPICS

39. Parallel Algorithms.

General Approaches.

Perfect Shuffles.

Systolic Arrays.

Perspective.
40. The Fast Fourier Transform.

Evaluate, Multiply, Interpolate.

Complex Roots of Unity.

Evaluation of the Roots of Unity.

Interpolation at the Roots of Unity.

Implementation.
41. Dynamic Programming.

Knapsack Problem.

Matrix Chain Product.

Optimal Binary Search Trees.

Time and Space Requirements.
42. Linear Programming.

Linear Programs.

Geometric Interpretation.

The Simplex Method.

Implementation.
43. Exhaustive Search.

Exhaustive Search in Graphs.

Backtracking.

Digression: Permutation Generation.

Approximation Algorithms.
44. NP-Complete Problems.

Deterministic and Nondeterministic Polynomial-Time

Algorithms.

NP-Completeness.

Cook’s Theorem.

Some NP-Complete Problems. 0201514257T04062001

Product Details

ISBN:
9780201514254
Author:
Sedgewick, Robert
Publisher:
Addison-Wesley Professional
Location:
Reading, Mass. :
Subject:
Programming Languages - C
Subject:
Programming Languages - General
Subject:
C (computer program language)
Subject:
Programming - General
Subject:
Algorithms
Subject:
Computer algorithms
Subject:
Language, literature and biography
Subject:
C
Subject:
Programming - Systems Analysis & Design
Subject:
Software Engineering - Programming and Languages
Copyright:
Edition Description:
Trade paper
Series:
Addison-Wesley Series in Computer Science
Series Volume:
raqm 24
Publication Date:
January 1990
Binding:
Hardcover
Grade Level:
Professional and scholarly
Language:
English
Illustrations:
Y
Pages:
672
Dimensions:
9.53x6.58x1.19 in. 2.08 lbs.

Other books you might like

  1. Swing New Trade Paper $49.95
  2. Computational Complexity New Trade Paper $154.75
  3. How to Draw Anime & Game Characters... Used Trade Paper $11.50
  4. Data Structures and Algorithms... Used Hardcover $16.95
  5. Developing Linux Applications (New... Used Trade Paper $6.95

Related Subjects

Computers and Internet » Computer Languages » C
Computers and Internet » Software Engineering » Programming and Languages
Reference » Science Reference » Technology

Algorithims in C (Addison-Wesley Series in Computer Science) New Hardcover
0 stars - 0 reviews
$72.50 Backorder
Product details 672 pages Addison-Wesley Professional - English 9780201514254 Reviews:
"Synopsis" by , Sedgewick's bestselling book, Algorithms, is now available for C programmers. Algorithms in C describes a variety of algorithms in a number of areas of interest, including: sorting, searching, string-processing, and geometric, graph and mathematical algorithms. The book emphasizes fundamental techniques, providing readers with the tools to confidently implement, run, and debug useful algorithms.
"Synopsis" by ,

This new version of the best-selling book, Algorithms, SecondEdition, provides a comprehensive collection of algorithmsimplemented in C. A variety of algorithms are described in eachofthe following areas: sorting, searching, string-processing,geometric, graph, and mathematical algorithms. These algorithmsare expressed in terms of concise implementations in C, so thatreaders can both appreciate their fundamental properties and testthem on real applications.

The treatment of analysis of algorithms is carefully developed. When appropriate, analytic results are discussed to illustratewhy certain algorithms are preferred, and in some cases, therelationship of the practical algorithms being disussed to purelytheoretical results is also described.Features

  • Hundreds of detailed, innovative figures clearly demonstratehow important algorithms work.
  • Throughout the book, "properties" sections encapsulatespecific information on the performance characteristics ofalgorithms.
  • Six chapters present fundamental concepts, including a briefintroduction to data structures.

Algorithms in C provides readers with the tools to confidentlyimplement, run, and debug useful algorithms. This book may beuseful for self-study, or as a reference for people engaged inthe development of computer systems for applications programs.

0201514257B04062001

spacer
spacer
  • back to top
Follow us on...




Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.