I have been studying about activity-selection-problem and the solution of greedy choice I came across is to select the activity that finishes in the earliest among the present activities.
But surely there are other greedy choices to solve the problem. The one I have been able to figure out is to select the activity that starts last.
My question is: are there any other greedy choices that can lead to solve activity selection problem? Any formal proof is also appreciated.