Media Summary: And so the runtime here is theta N. So here, this alternate approach, which I am calling So for this problem we are asked to apply um the In this session in this session we look into another so we look into a demo of
Lecture 2 Quick Find Quick - Detailed Analysis & Overview
And so the runtime here is theta N. So here, this alternate approach, which I am calling So for this problem we are asked to apply um the In this session in this session we look into another so we look into a demo of
![[Disjoint Sets, Video 2] - Quick Find](https://i.ytimg.com/vi/W6Dckcv8PIo/mqdefault.jpg)
![Lecture 5 : Algorithms : Quick-Find Demo [Example from Princeton Uni]](https://i.ytimg.com/vi/kPnpFJkLKoM/mqdefault.jpg)
![Lecture 4 : Algorithms : Quick-Find [Eager Approach]](https://i.ytimg.com/vi/qYWnYc-NROA/mqdefault.jpg)