Welcome to Algorithms, Part I! You’re joining thousands of learners currently enrolled in the course. I'm excited to have you in the class and look forward to your contributions to the learning community.

To begin, I recommend taking a few minutes to explore the course site. Review the material we’ll cover each week, and preview the assignments you’ll need to complete to pass the course. Click Discussions to see forums where you can discuss the course material with fellow students taking the class.

⭐ Table of Contents ⭐
(00:00) Course Introduction
(09:22) Dynamic Connectivity
(19:44) Quick Find
(30:03) Quick Union
(37:53) Quick-Union Improvements
(50:56) Union−Find Applications
(1:01:08) Analysis of Algorithms Introduction
(1:10:35) Observations
(1:20:40) Mathematical Models
(1:33:29) Order-of-Growth Classifications
(1:48:08) Theory of Algorithms
(1:59:43) Memory
(2:07:54) Stacks
(2:24:18) Resizing Arrays
(2:34:14) Queues
(2:37:47) Generics
(2:47:13) Iterators
(2:54:29) Stack and Queue Applications (optional)
(3:07:53) Sorting Introduction
(3:22:36) Selection Sort
(3:29:35) Insertion Sort
(3:39:08) Shellsort
(3:49:50) Shuffling
(3:57:29) Convex Hull
(4:10:19) Mergesort
(4:34:12) Bottom-up Mergesort
(4:37:32) Sorting Complexity
(4:46:37) Comparators
(4:53:20) Stability
(4:59:00) Priority Queues
(6:08:46) System Sorts
(7:45:00) Balanced Search Trees

New To My Channel Subscribe Now And See More Stuff Like This:
   / @freecodeacademy633  
#Algorithms#