The Greedy Method
A simple example
Problem: Pick k numbers out of n
numbers such that the sum of
these k numbers is the largest.
FOR i = 1 to k
pick out the largest number and
delete this number from the
A Greedy Algorithm for Scheduling Jobs with Deadlines and
The setting is that we have n jobs, each of which takes unit time, and a processor on which we
would like to schedule them in as profitable a manner as possible. Each job has a profit ass
CS 535: Design and Analysis of Algorithms - CS Dept, Illi.
CS 535: Design and Analysis of Algorithms
The course will advance the study of algorithms.
The study will include techniques of algorithm design and design of data structures for improv
for Version 3-8-0
Remco R. Bouckaert
April 14, 2016
University of Waikato, Hamilton, New Zealand
Alex Seewald (original Commnd-line primer)
David Scuse (o