About This Course
Course Curriculum
-
Kurt Anderson – Promo00:02:00
-
Introduction00:01:00
-
Binary System00:11:00
-
Complexity Introduction00:02:00
-
Math Refresher Factorial Functions.TS00:03:00
-
Math Refresher Factorial Functions.TS Part 0200:03:00
-
Math Refresher Algebraic Expressions.TS Part 0300:03:00
-
N-notation00:18:00
-
Big O00:13:00
-
Big O Real World Example00:10:00
-
How is Data Stored00:09:00
-
Fixed Arrays00:20:00
-
Circular Arrays00:08:00
-
Dynamic Arrays00:16:00
-
Array Review00:08:00
-
Array Real World Examples00:06:00
-
Nodes00:04:00
-
Linked List00:14:00
-
Linked List Run Times00:15:00
-
Doubly Linked Lists00:08:00
-
Tail Pointer00:05:00
-
Linked List Real World Examples00:03:00
-
Linked List Review00:04:00
-
Stacks00:10:00
-
Stack Example00:11:00
-
Queues00:09:00
-
Queue Examples00:10:00
-
Queue and Stack Run Times00:06:00
-
Stack and Queues Real World Examples00:07:00
-
Sorting Algorithm Introduction00:02:00
-
Bubble Sort00:10:00
-
Selection Sort00:10:00
-
Insertion Sort00:09:00
-
Quick Sort00:15:00
-
Quick Sort Run Times00:10:00
-
Merge Sort00:12:00
-
Merge Sort Run Times
-
Stable vs Nonstable00:07:00
-
Sorting Algorithm Real World Examples00:04:00
-
Basics of Trees00:08:00
-
Binary Search Tree00:09:00
-
BST Run Times00:08:00
-
Tree Traversals00:13:00
-
Tree Real World Examples00:05:00
-
Heap Introduction00:04:00
-
Heap Step by Step00:12:00
-
Heap Real World Examples00:07:00
-
Thank You00:01:00