Advantages and Disadvantages of Binary search Tree
21
Graphs introduction
22
Breadth-first search implementation
23
Depth-first search implementation
24
Hash tables introduction
25
Hashing implementation
26
Algorithms introduction and algorithmic analysis
27
Finding space and time complexity
28
Linear Search
29
Linear search implementation
30
Complexity analysis of Linear Search
31
Binary Search
32
Binary search implementation
33
Complexity analysis of Binary Search
34
Insertion sort
35
Insertion sort implementation
36
Complexity analysis of Insertion sort
37
Selection sort
38
Selection sort implementation
39
Complexity analysis of Selection sort
40
Quicksort
41
Quicksort implementation
42
Complexity analysis of Quicksort
43
Introduction to Divide and Conquer approach
44
Merge sort
45
merge sort implementation
46
Introduction to Greedy's approach
47
Prim's minimal Spanning Tree algorithm
48
Prim's minimal Spanning Tree algorithm implementation
49
Introduction to Dynamic Programming
50
Tower of Hanoi
51
Tower of Hanoi implementation
52
Summary
Description:
Dive into a comprehensive 8-hour video course on Data Structures and Algorithms using Python. Begin with fundamental concepts like arrays, stacks, queues, and linked lists, progressing to advanced topics such as binary trees, graphs, and hash tables. Master essential algorithms including linear and binary search, various sorting techniques, and algorithmic analysis. Explore key programming paradigms like divide-and-conquer, greedy algorithms, and dynamic programming. Gain hands-on experience through Python implementations of each concept, understanding their advantages, disadvantages, and complexity analysis. Perfect for beginners looking to build a strong foundation in computer science fundamentals and improve their problem-solving skills.
Data Structures and Algorithms in Python for Beginners