Guest
Trees\ 6:45 Red-Black Tree vs 2-3-4 Tree Deletion \ 18:45 Introduction to Heap 22:49 Inserting in a Heap 30:30 Program to Insert in a Heap 34:53 Creating a Heap 46:10 Deleting from Heap and Heap Sort 58:45 Let’s Code Heap Sort 1:13:45 Heapify - Faster Method for creating Heap 1:22:33 Heap as Priority Queue Techniques\ 1:29:57 Criteria used for Analysing Sorts 1:38:31 Bubble Sort 1:58:41 Let’s Code Bubble Sort 2:05:11 Insertion Sort 2:11:15 Insertion Sort Continued 2:20:21 Program for Insertion Sort 2:25:26 Analysis of Insertion Sort 2:29:49 Let’s Code Insertion Sort 2:32:23 Comparing Bubble and Insertion Sort 2:35:05 Selection Sort 2:46:13 Program for Selection Sort 2:48:55 Analysis of Selection Sort 2:52:05 Let’s Code Selection Sort 2:54:31 Idea behind Quick Sort 3:01:07 Quick Sort 3:09:31 Analysis of Quick Sort 3:19:43 Analysis of Quick Sort Continued 3:32:15 Let’s Code Quick Sort 3:38:49 Merging 3:55:57 Iterative Merge Sort 4:07:25 Let’s Code Iterative Merge Sort 4:15:06 Recursive Merge Sort 4:33:08 Let’s Code Recursive Merge Sort 4:35:56 Count Sort 4:47:57 Let’s Code Count Sort 4:54:24 Bin _ Bucket Sort 5:04:34 Radix Sort 5:18:56 Shell Sort 5:40:16 Let’s Code Shell Sort Technique\ 5:43:23 Introduction to Hashing 5:59:23 Chaining 6:14:28 Let’s Code Chaining 6:21:20 Linear Probing 6:38:42 Let’s Code Linear Probing 6:48:23 Quadratic Probing 6:53:05 Double Hashing 7:02:32 Hash Function Ideas \ 7:12:22 Introduction to Graphs 7:21:06 Representation of Undirected Graph 7:35:10 Representation of Directed Graphs 7:41:43 Breadth First Search 7:59:28 Program for BFS 8:08:30 Depth First Search 8:19:03 Program for DFS 8:23:14 Let’s Code BFS & DFS 8:35:42 Spanning Trees 8:43:32 Prim’s Minimum Cost Spanning Tree 8:50:30 Prim’s Program 9:19:44 Let’s Code Prim’s using 9:31:33 Kruskal’s Minimum Cost Spanning Tree 9:37:50 Disjoint Subsets 9:51:42 Kruskal’s Program 10:11:15 Let’s Code Kruskla’s Program Notations\ 10:20:51 Asymptotic Notations Big Oh , Omega , Theta
