2[ job numbers are in non-increasing order of profit, d is deadline vector ]
3local i;
4J ← 1; [ best job always selected ]
5fori ← 2 to n do
6if all jobs in J∪ {i} can be completed by their deadlines then
7J ← J∪i;
8end
9end
We can keep the jobs in the set J in an array j [ ] sorted by non-decreasing order of deadlines, which will
be easier to perform the feasibility check. On the other hand, we assume that job numbers are given in non-
increasing order of profi t p, thus their deadlines are stored in ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.
Julian F.
Head of Cybersecurity
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.
Addison B.
Field Engineer
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.
Amir M.
Data Platform Tech Lead
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.