Question: This algorithm finds the most optimal days to work for a job where if you work one day, you can't work the day before or

This algorithm finds the most optimal days to work for a job where if you work one day, you can't work the day before or after. How would the algorithm change if it changed to, you can work 2 days in a row but you can't work the day before or after?
JobSelection (P[1 n]) /[1...n] be an array of numbers of size n J[2] max(P[1], P[2]} For i3 to n do: a =J[1-2] + P [i] End For Return J[n] End JobSelection
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
