Introduction | |||
Kurt Anderson – Promo | 00:02:00 | ||
Introduction | 00:01:00 | ||
Binary System | 00:11:00 | ||
Analyzing Algorithms | |||
Complexity Introduction | 00:02:00 | ||
Math Refresher Logarithmic Functions Part 01 | 00:11:00 | ||
Math Refresher Factorial Functions.TS Part 02 | 00:03:00 | ||
Math Refresher Algebraic Expressions.TS Part 03 | 00:03:00 | ||
N-notation | 00:18:00 | ||
Big O | 00:13:00 | ||
Big O Real World Example | 00:10:00 | ||
Arrays | |||
How is Data Stored | 00:09:00 | ||
Fixed Arrays | 00:20:00 | ||
Circular Arrays | 00:08:00 | ||
Dynamic Arrays | 00:16:00 | ||
Array Review | 00:08:00 | ||
Array Real World Examples | 00:06:00 | ||
Linked Lists | |||
Linked List | 00:14:00 | ||
Nodes | 00:04:00 | ||
Linked List Run Times | 00:15:00 | ||
Doubly Linked Lists | 00:08:00 | ||
Tail Pointer | 00:05:00 | ||
Linked List Real World Examples | 00:03:00 | ||
Linked List Review | 00:04:00 | ||
Stacks and Queues | |||
Stacks | 00:10:00 | ||
Stack Example | 00:11:00 | ||
Queues | 00:09:00 | ||
Queue Examples | 00:10:00 | ||
Queue and Stack Run Times | 00:06:00 | ||
Stack and Queues Real World Examples | 00:07:00 | ||
Sorting Algorithms | |||
Sorting Algorithm Introduction | 00:02:00 | ||
Bubble Sort | 00:10:00 | ||
Selection Sort | 00:10:00 | ||
Insertion Sort | 00:09:00 | ||
Quick Sort | 00:15:00 | ||
Quick Sort Run Times | 00:10:00 | ||
Merge Sort | 00:12:00 | ||
Merge Sort Run Times | 00:00:00 | ||
Stable vs Nonstable | 00:07:00 | ||
Sorting Algorithm Real World Examples | 00:04:00 | ||
Trees | |||
Basics of Trees | 00:08:00 | ||
Binary Search Tree | 00:09:00 | ||
BST Run Times | 00:08:00 | ||
Tree Traversals | 00:13:00 | ||
Tree Real World Examples | 00:05:00 | ||
Heaps | |||
Heap Introduction | 00:04:00 | ||
Heap Step by Step | 00:12:00 | ||
Heap Real World Examples | 00:07:00 | ||
Conclusion | |||
Thank You | 00:01:00 | ||
Order Your Certificate | |||
Order Your Certificate Now | 00:00:00 |
Membership renews after 12 months. You can cancel anytime from your account.