On slide 11 "Thus if there were more than n compatible jobs in sigma*, they would also be compatible with the jobs in sigma, but then the greedy algorithm would have added at least one of them." Wouldn't the greedy algorithm have added all of them always? Why is "This contradicts that sigma contains n jobs" even important?
Thank you Tim
On slide 10, why can the range of k be up to "n"?
From slide 9, I think the range of k can only be up to "m".
Thanks for the great video!
that's a quality video
I wish my instructor teached like you do
On slide 11
"Thus if there were more than n compatible jobs in sigma*, they would also be compatible with the jobs in sigma, but then the greedy algorithm would have added at least one of them."
Wouldn't the greedy algorithm have added all of them always? Why is "This contradicts that sigma contains n jobs" even important?
Please teach properly, unable to form words even. Thanks though, but left more confused than I came in.