Essential Algorithms - A Practical Approach to Computer Algorithms By Rod Stephens.2013.pdf

Table of Contents
Chapter 1: Algorithm Basics
Approach
Algorithms and Data Structures
Pseudocode
Algorithm Features
Practical Considerations
Summary
Exercises
Chapter 2: Numerical Algorithms
Randomizing Data
Finding mon Divisors
Performing Exponentiation
Working with Prime Numbers
Performing Numerical Integration
Finding Zeros
Summary
Exercises
Chapter 3: Linked Lists
Basic Concepts
Singly Linked Lists
Doubly Linked Lists
Sorted Linked Lists
Linked-List Algorithms
2
Linked List Selectionsort
Multithreaded Linked Lists
Linked Lists with Loops
Summary
Exercises
Chapter 4: Arrays
Basic Concepts
One-dimensional Arrays
Nonzero Lower Bounds
Triangular Arrays
Sparse Arrays
Matrices
Summary
Exercises
Chapter 5: Stacks and Queues
Stacks
Queues
Summary
Exercises
Chapter 6: Sorting
O(N2) Algorithms
O(N log N) Algorithms
Sub O(N log N) Algorithms
Summary
3
Exercises
Chapter 7: Searching
Linear Search
Binary Search
Interpolation Search
Summary
Exercises
Chapter 8: Hash Tables
Hash Table Fundamentals
Chaining
Open Addressing
Summary
Exercises
Chapter 9: Recursion
Basic Algorithms
Graphical Algorithms
Backtracking Algorithms
Selections and Permutations
Recursion Removal
Summary
Exercises
Chapter 10: Trees
Tree Terminology
Binary Tree Properties
4
Tree Representations
Tree Traversal
Sorted Trees
Threaded Trees
Specialized Tree Algorithms
Summary
Exercises
Chapter 11: Balanced Trees
AVL Trees
2-3 Trees
B-Trees
Balanced Tree Variations
Summary
Exercises
Chapter 12: Decision Trees
Searching Game Trees
Searching General Decision Trees
Summary
Exercises
Chapter 13: work Algorithms
Network Terminology
Network Representations
Traversals
Finding Paths
5
Summary
Exercises
Chapter 14: work Algorithms
Topological Sorting
Cycle Detection
Map Coloring
Maximal Flow
Summary
Exercises
Chapter 15: String Algorithms
Matching Parentheses
Pattern Matching
String Searching
Calculating Ed