Register

Algorithm CLRS Book exercise question

794 views
2 2 votes
16.1-2
Suppose that instead of always selecting the first activity to finish, we instead select
the last activity to start that is compatible with all previously selected activities. Describe how this approach is a greedy algorithm, and prove that it yields an optimal
solution.

Has anybody solved this question ?

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · GATE CS SET-1 2016 Q...Next → · Self made
← Previous in category · study-resourcesNext in category → · Graph traversal
Position:
Show:

Related questions

2 2 votes
0 0 answers
1.2k
1.2k views
Rajeev Kumar 1 asked Jan 9, 2018
1,245 views
clrs book
T(N)=3T((N/3)+5)+N/2what will be the time complexity?
0 0 votes
2 2 answers
3.9k
3.9k views
Arnab Bhadra asked Jun 30, 2017
3,928 views
CLRS Book Exercises 4.4-5
Use recursion tree method to determine Upper Bound ofT(n) = T(n-1) + T(n/2) + n
2 2 votes
2 answers 2 answers
1.3k
1.3k views
Manasi Srivastava asked Oct 9, 2017
1,298 views
CLRS Divide-and-Conquer Strassens's algorithm
Do we need to study the Strassens's algorithm in detail like proof or working of that algorithm or we just need to know the time complexity of the algorithm because I can...
0 0 votes
0 0 answers
859
859 views
vk_9_1_9 asked Dec 31, 2018
859 views
CLRS HASHING(EXERCISE 11.2-3)
Q)Professor Marley hypothesizes that substantial performance gains can be obtainedif we modify the chaining scheme so that each list is kept in sorted order. Howdoes the ...