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
03-Introduction to Algorithms
Intro to Algorithm Analysis
01-Complexity
02-LogLog-Plot
03-Approximations
04-Orders of Growth
Arrays
01-Quick Overview of Arrays in C#
02-Arrays In Memory
03-Time Complexitiy of Operations on Array
Sorting Algorithms
01-Bubble Sort (Theory)
02-Bubble Sort (Implementation)
03-Stable and Unstable Sort
04-Selection Sort (Theory)
05-Selection Sort (Implementation)
06-Insertion Sort (Theory)
07-Insertion Sort (Implementation)
08-Recursion
09-Shell Sort (Theory)
10-Shell Sort (Implementation)
11-Merge Sort (Theory)
12-Merge Sort (Implementation)
13-Quick Sort (Theory)
14-Quick Sort (Implementation)
Lists
01-List Built-In BCL
02-Node as a Building Block
03-Linked Lists
04-Singly Linked List (Theory)
05-Singly Linked List (Implementation)
06-Doubly Linked List (Theory)
07-Doubly Linked List (Implementation)
08-Linked List Built In BCL
Stacks
01-Stacks (Theory)
02-Stacks Implementation (Array)
03-Stack Implementation (LinkedList)
04-Stack Built In BCL
Queues
01-Queue (Theory)
02-Queue (Implementation)
03-Circular Queue (Theory)
04-Circular Queue (Implementation)
05-Queue Implementation (Linked List)
06-Queue Built-In BCL
Search Algorithms
01-Linear Search
02-Binary Search (Theory)
03-Binary Search (Implementation)
Symbol Tables
01-Introduction to Symbol Tables
02-General API of Symbol Tables
03-Sequential Search
04-Sequential Search - Homework
05-Sequential Search - Solution for Homework
06-BST
07-BST Homework
08-BST Solution for Homework
09-Conclusion
Hashing and Symbol Tables
01-Introduction
02-More on Hashing
03-GetHashCode by Default in Ref and Val
04-Implementing GetHashCode
05-Resolving Collisions
06-Separate Chaining
07-Separate Chaining HW
08-Separate Chaining HW-Solution
09-Linear Probing
10-Dictionary in BCL Internals
11-Sets in .NET
Trees
01-Intro
02-BST (Theory)
03-Simple BST Implementation
04-Removal Theory
05-Removal Implementation
Heaps
01-Heaps Intro
02-Heaps and Arrays
03-Heap Insertion (Theory)
04-Heap Implementation
05-Heap Remove Theory
06-Heap Remove Implementation
07-Heap Performance
08-Heap Sort
09-Heap Sort Implementation
Concurrent Collections
01-Outline
02-Introduction
03-Immutability and Memory Pressure
04-Immutable Stack and Queue
05-Immutable List
06-Immutable Sets
07-Immutable Dictionaries
08-Builders in Immutable Collections
09-ConcurrentQueue and ConcurrentStack
10-ConcurrentBag
11-ConcurrentDictionary
12-Conclusion
Different Algorithms
01-Sieve of Eratosthenes
04-Singly Linked List (Theory)
Lesson content locked
If you're already enrolled,
you'll need to login
.
Enroll in Course to Unlock