Algorithms in C

Name: Algorithms in C
Availability: OutOfStock
ISBN: 9780201849370

ISBN-10: 0201849372

ISBN-13: 9780201849370

Edition: 3rd 2020 (Revised)

Authors: Robert Sedgewick

List price: $59.95

30 day, 100% satisfaction guarantee!

Out of stock

We're sorry. This item is currently unavailable.

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

This text provides an introduction to important algorithms and data structures. It also blends theory with practice with particular attention on pedagogy.

Book details

List price: $59.95
Edition: 3rd
Copyright year: 2020
Publisher: Addison-Wesley Longman, Incorporated
Binding: Hardcover
Pages: 1312
Size: 7.76" wide x 9.25" long
Weight: 2.2




Fundamentals



Introduction


Algorithms


Outline of Topics



C. Example: Euclid's Algorithm


Types of Data


Input/Output


Concluding Remarks



Elementary Data Structures


Arrays


Linked Lists


Storage Allocation


Pushdown Stacks


Queues


Abstract Data Types



Trees


Glossary


Properties


Representing Binary Trees


Representing Forests


Traversing Trees



Recursion


Recurrences


Divide-and-Conquer


Recursive Tree Traversal


Removing Recursion


Perspective



Analysis of Algorithms


Framework


Classification of Algorithms


Computational Complexity


Average-Case Analysis


Approximate and Asymptotic Results


Basic Recurrences


Perspective



Implementation of Algorithms


Selecting an Algorithm


Empirical Analysis


Program Optimization


Algorithms and Systems



Sorting Algorithms



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



Quicksort


The Basic Algorithm


Performance Characteristics of Quicksort


Removing Recursion


Small Subfiles


Median-of-Three Partitioning


Selection



Radix Sorting


Bits


Radix Exchange Sort


Straight Radix Sort


Performance Characteristics of Radix Sorts


A Linear Sort



Priority Queues


Elementary Implementations


Heap Data Structure


Algorithms on Heaps


Heapsort


Indirect Heaps


Advanced Implementations



Mergesort


Merging


Mergesort


List Mergesort


Bottom-up Mergesort


Performance Characteristics


Optimized Implementations


Recursion Revisited



External Sorting


Sort-Merge


Balanced Multiway Merging


Replacement Selection


Practical Considerations


Polyphase Merging


An Easier Way



Searching Algorithms



Elementary Searching Methods


Sequential Searching


Binary Search


Binary Tree Search


Deletion


Indirect Binary Search Trees



Balanced Trees


Top-Down 2-3-4 Trees


Red-Black Trees


Other Algorithms



Hashing


Hash Functions


Separate Chaining


Linear Probing


Double Hashing


Perspective



Radix Searching


Digital Search Trees


Radix Search Tries


Multiway Radix Searching


Patricia



External Searching


Indexed Sequential Access


B-Trees


Extendible Hashing


Virtual Memory



String Processing



String Searching


A Short History


Brute-Force Algorithm


Knuth-Morris-Pratt Algorithm


Boyer-Moore Algorithm


Rabin-Karp Algorithm


Multiple Searches