Solutions of Theory of Algorithms assignment16.1-2

Solutions of Theory of Algorithms assignment16.1-2 -...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Solutions of Theory of Algorithms Assignment 3 Exercise 16.1-2 Select the last activity to start that is compatible with all previously selected activities is the mirror algorithm of selecting the first activity to finish. It is the same idea as the
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: proposed algorithm in chapter 16. It is greedy algorithm as it looks for the local optimal solution...
View Full Document

This note was uploaded on 11/09/2010 for the course CS 11841 taught by Professor Dr.ayman during the Spring '09 term at Alexandria University.

Ask a homework question - tutors are online