Algorithms (English) (Part 1)

   Tuesday, September 22, 2026   

Starting a new Lecture Notes Series on Algorithms

Youtube Lecture Playlist Credits 

Channel Name: IEMDaily - Video Lecture Notes (English)

So Let Us Start to This Journey of Learning 

Algorithms By Lecture Notes together!

Lecture 1: 01. Visualizing Algorithmic Bounds

Lecture 2: 02. Geometries of Scale

Lecture 3: 03. Decoding Recursive Complexity

Lecture 4: 04. Mastering Asymptotic Growth

Lecture 5: 05. Mastering Recurrences

Lecture 6: 06. Memory Architecture

Lecture 7: 07. Amortized Analysis

Lecture 8: 08. Aggregate Analysis

Lecture 9: 09. Amortizing Expansion

Lecture 10: 10. Insertion Sort Mechanics

Lecture 11: 11. Merge Sort Deconstructed

Lecture 12: 12. Quick Sort Deconstructed

Lecture 13: 13. The Quick Sort Paradox

Lecture 14: 14. The Heap

Lecture 15: 15. Max Heap Mastery

Lecture 16: 16. Linear Max Heap Construction

Lecture 17: 17. Max Heap Mechanics

Lecture 18: 18. Visualizing Heap Sort

Lecture 19: 19. Advanced Heap Architecture

Lecture 20: 20. Deconstructing Radix Sort

Lecture 21: 21. Optimized Bubble Sort

Lecture 22: 22. Bucket Sort

Lecture 23: 23. Visual Counting Sort

Lecture 24: 24. Fluid Bubble Sort

Lecture 25: 25. Sorting Complexity Analysis

Lecture 26: 26. Max Heap Visualized

Lecture 27: 27. Max Heap Insertion Visualized

Lecture 28: 28. Max Heap Interchanges

Lecture 29: 29. Max Heap Visualized

Lecture 30: 30. Max Heapify Deconstructed

Lecture 31: 31. Visualizing Radix Sort

Lecture 32: 32. Bubble Sort Geometry

Lecture 33: 33. Binary Search Logic

Lecture 34: 34. Linear Search

Lecture 35: 35. Amortized Disjoint Set Analysis

Lecture 36: 36. Union by Rank Visualized

Lecture 37: 37. Amortized Growth Analysis

Lecture 38: 38. Disjoint Sets

Lecture 39: 39. Disjoint Set Linked Lists

Lecture 40: 40. Linked List Disjoint Sets

Lecture 41: 41. Disjoint Set Amortization

Lecture 42: 41. Disjoint Set Amortization