Proof of Greedy Approach.

Revision en1, by rr459595, 2019-07-14 00:02:57

I came across this problem on leetcode. ( https://leetcode.com/problems/task-scheduler/ ) . I get the intuition of why greedy approach in round robin approach should work but not able to prove that it's always optimal.

Can someone help me in proving it ?

Thanks.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English rr459595 2019-07-14 00:03:39 18
en1 English rr459595 2019-07-14 00:02:57 293 Initial revision (published)