دانلود کتاب Grokking Algorithms, Second Edition (MEAP v1)

فهرست مطالب :

Grokking Algorithms, Second Edition MEAP V01
Copyright
Welcome
Brief contents
Chapter 1: Introduction to algorithms
Introduction
What you’ll learn about performance
What you’ll learn about solving problems
Binary search
A better way to search
Exercises
Running time
Big O notation
Algorithm running times grow at different rates
Visualizing different Big O run times
Big O establishes a worst-case run time
Some common Big O run times
Exercises
The traveling salesperson
Recap
Chapter 2: Selection sort
How memory works
Arrays and linked lists
Linked lists
Arrays
Terminology
Exercise
Inserting into the middle of a list
Deletions
Exercises
Selection sort
Example code listing
Recap
Chapter 3: Recursion
Recursion
Base case and recursive case
The stack
The call stack
Exercise
The call stack with recursion
Exercise
Recap
Chapter 4: Quicksort
Divide & conquer
Exercises
Quicksort
Big O notation revisited
Merge sort vs. quicksort
Average case vs. worst case
Exercises
Recap
Chapter 5: Hash tables
Hash functions
Exercises
Use cases
Using hash tables for lookups
Preventing duplicate entries
Using hash tables as a cache
Recap
Collisions
Performance
Load factor
A good hash function
Exercises
Recap
Chapter 6: Breadth-first search
Introduction to graphs
What is a graph?
Breadth-first search
Finding the shortest path
Queues
Exercises
Implementing the graph
Implementing the algorithm
Running time
Exercise
Recap
Chapter 7: Trees
Your first tree
File Directories
A Space Odyssey: depth-first search
A better definition of trees
Binary trees
Huffman coding
Recap