Thanks for subscribing!
---
This video is about a greedy algorithm for interval partitioning. With this algorithm you can minimize the amount of resources needed when partitioning intervals.
In the video the following concepts are explained:
- The problem.
- The solution to the problem.
- An example on how the algorithm works.
- The pseudocode for the solution.
- The running time of the provided pseudocode.
- The depth within interval partitioning.
- A proof that shows that the solution is correct.
- A proof that shows that the solution is optimal.
- Some implementation details (use of a priority queue).
---
If you thought this video was useful, make sure to give it a like!
If you want to support this channel, make sure to subscribe.
If you have any questions, use the comment section.
This video has been published by MisterCode.
Негізгі бет Interval Partitioning ( Greedy Algorithm ) - Algorithms
Пікірлер: 31