Autoplay
Autocomplete
Previous Lesson
Complete and Continue
Algorithms and Data Structures in C#: Complete Tutorial
Intro to Algorithms and Data Structures
01-Download Source Code
02-Introduction to Data Structures (5:43)
03-Introduction to Algorithms (4:03)
Intro to Algorithm Analysis
01-Complexity (16:06)
02-LogLog-Plot (5:23)
03-Approximations (5:40)
04-Orders of Growth (5:01)
Arrays
01-Quick Overview of Arrays in C# (20:02)
02-Arrays In Memory (9:21)
03-Time Complexitiy of Operations on Array (16:18)
Sorting Algorithms
01-Bubble Sort (Theory) (6:21)
02-Bubble Sort (Implementation) (14:03)
03-Stable and Unstable Sort (5:34)
04-Selection Sort (Theory) (4:03)
05-Selection Sort (Implementation) (5:24)
06-Insertion Sort (Theory) (6:21)
07-Insertion Sort (Implementation) (5:46)
08-Recursion (14:32)
09-Shell Sort (Theory) (12:23)
10-Shell Sort (Implementation) (8:35)
11-Merge Sort (Theory) (7:43)
12-Merge Sort (Implementation) (12:27)
13-Quick Sort (Theory) (8:07)
14-Quick Sort (Implementation) (7:39)
Lists
01-List Built-In BCL (22:56)
02-Node as a Building Block (7:43)
03-Linked Lists (1:09)
04-Singly Linked List (Theory) (4:28)
05-Singly Linked List (Implementation) (24:11)
06-Doubly Linked List (Theory) (2:02)
07-Doubly Linked List (Implementation) (13:43)
08-Linked List Built In BCL (5:39)
Stacks
01-Stacks (Theory) (4:46)
02-Stacks Implementation (Array) (16:06)
03-Stack Implementation (LinkedList) (7:17)
04-Stack Built In BCL (3:26)
Queues
01-Queue (Theory) (6:11)
02-Queue (Implementation) (11:37)
03-Circular Queue (Theory) (2:07)
04-Circular Queue (Implementation) (15:32)
05-Queue Implementation (Linked List) (5:51)
06-Queue Built-In BCL (5:30)
Search Algorithms
01-Linear Search (19:29)
02-Binary Search (Theory) (3:03)
03-Binary Search (Implementation) (11:30)
Symbol Tables
01-Introduction to Symbol Tables (2:37)
02-General API of Symbol Tables (6:31)
03-Sequential Search (12:35)
04-Sequential Search - Homework (0:53)
05-Sequential Search - Solution for Homework (6:12)
06-BST (26:10)
07-BST Homework (2:39)
08-BST Solution for Homework (11:26)
09-Conclusion (1:11)
Hashing and Symbol Tables
01-Introduction (4:53)
02-More on Hashing (9:53)
03-GetHashCode by Default in Ref and Val (6:50)
04-Implementing GetHashCode (28:25)
05-Resolving Collisions (4:56)
06-Separate Chaining (20:39)
07-Separate Chaining HW (1:59)
08-Separate Chaining HW-Solution (16:24)
09-Linear Probing (22:02)
10-Dictionary in BCL Internals (4:37)
11-Sets in .NET (7:31)
Trees
01-Intro (4:21)
02-BST (Theory) (6:32)
03-Simple BST Implementation (25:43)
04-Removal Theory (5:29)
05-Removal Implementation (9:21)
Heaps
01-Heaps Intro (3:54)
02-Heaps and Arrays (3:31)
03-Heap Insertion (Theory) (2:17)
04-Heap Implementation (15:40)
05-Heap Remove Theory (3:18)
06-Heap Remove Implementation (18:13)
07-Heap Performance (1:11)
08-Heap Sort (5:11)
09-Heap Sort Implementation (4:58)
Concurrent Collections
01-Outline (1:32)
02-Introduction (4:37)
03-Immutability and Memory Pressure (6:36)
04-Immutable Stack and Queue (9:24)
05-Immutable List (4:35)
06-Immutable Sets (5:23)
07-Immutable Dictionaries (4:28)
08-Builders in Immutable Collections (4:13)
09-ConcurrentQueue and ConcurrentStack (5:49)
10-ConcurrentBag (4:08)
11-ConcurrentDictionary (7:49)
12-Conclusion (2:01)
Different Algorithms
01-Sieve of Eratosthenes (10:11)
03-GetHashCode by Default in Ref and Val
Lesson content locked
If you're already enrolled,
you'll need to login
.
Enroll in Course to Unlock