Hey everyone I am working on PS #4 problem 4 and I am having some trouble (I am stuck on how to start this one). I've attached the shell code that explains what the function is intended to do. Any help/advice would be greatly appreciated.
MIT 6.00 Intro Computer Science (OCW)
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga.
Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus.
Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
find_best_shifts is a wrapper function for find_best_shifts_rec which does the actual work. Look around, there's been a bunch of questions on recursion lately.
this is perhaps the heart of the problem set...it takes quite a bit of time tough to do this portion of problem
it took me around 2 days to figure out the correct code (after so many failures tough)
since i had done this problem set...i recommend that you should try out pseudo code first and then try to implement it ...take about a day to do so
if you still face problems then do ask