Thanks for subscribing!
This video is about a greedy algorithm for interval scheduling.
The problem is also known as the activity selection problem.
In the video the following concepts are explained:
– The problem
– The solution to the problem
– The pseudocode for the solution
– The running time of the provided pseudocode.
– A proof that shows that the solution is right
– Some tips on the implementation
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.