What's a liveVideo?
Algorithms in Motion
Based on the best-selling Grokking Algorithms
Good and simple to understand introduction to algorithms.
Table of Contents detailed table of contents
Introduction to Algorithms
Introduction
Binary Search
Big O Notation
Selection Sort
Arrays and Linked Lists
Selection Sort
Recursion
Recursion
The Stack
Quicksort
Divide and Conquer
Quicksort
Big O Notation Revisited
Hash Tables
Hash Functions
Use Cases
Collisions
Performance
Breadth-first search
What is a graph?
Breadth-first search
Implementing the graph
Implementing the algorithm
Recap
Dijkstra’s algorithm
Working with Dijkstra’s algorithm
Terminology
Trading for a piano
Negative-weight edges
Implementation
Recap
Greedy algorithms
The classroom scheduling problem
The knapsack problem
The set-covering problem
NP-complete problems
Traveling salesperson, step by step
Recap
K-nearest neighbors
Classifying oranges vs. grapefruit
Building a recommendations system
Intro to machine learning
Recap
Dynamic programming
The knapsack problem
Knapsack problem FAQ
Longest common substring
Recap
Where to go next
Trees
Inverted indexes
The Fourier transform
Parallel algorithms
MapReduce
Bloom filters and HyperLogLog
The SHA algorithms
Locality-sensitive hashing
Diffie-Hellman key exchange
Linear programming
About the subject
An algorithm is a repeatable procedure for solving a problem. The algorithms you'll use most often as a programmer have already been discovered, tested, and proven. This engaging course makes it easy to learn and use the most important algorithms effectively.About the video
Algorithms in Motion teaches you how to apply common algorithms to the practical problems you face every day as a programmer. Following the expert guidance of liveVideo instructor Beau Carnes, you'll start with the basics, including Big O notation, fundamental data structures, and recursion. Then, you'll explore problem-solving techniques, that will empower you to see the algorithm you need in the task you're trying to accomplish. Finally, you'll finish the course by applying more advanced algorithms, such as hash tables, graph algorithms, and K-nearest.Prerequisites
This easy-to-follow video course is perfect for self-taught programmers, engineers, or anyone who wants to brush up on classic algorithms.What you will learn
- Search, sort, and graph algorithms
- Breadth-first search
- Performance concerns
- Implementing algorithms in Python
About the instructor
liveVideo instructor Beau Carnes is a software developer and a recognized authority in software instruction. Besides teaching in-person workshops and classes, he has also created around 100 software training videos that receive over 40K views per month. This includes a series on data structures and algorithms. Grokking Algorithms by Adit Bhargava is available at manning.com in pBook, eBook, and liveBook formats.
Buy
What's a liveVideo?
What's a liveVideo?
- Quality video lessons by expert programmers.
- Rich, interactive transcripts for navigation.
- Exercise driven learning.
Great way to quickly recap the most common algorithms.
Explains the fundamentals of some fairly complex computer science in a way that makes sense to anyone.
A gentle introduction to the traditional computer science topics of data structures and algorithms in a way that is not intimidating to approach.