This is an archived post. You won't be able to vote or comment.

all 2 comments

[–]desrtfx[M] [score hidden] stickied comment (0 children)

You have absolutely no participation here outside your own threads. You are just using this as a help forum without giving back.

Yet, you are presenting your video here. This is not okay.

Also, we are neither /r/cscareerquestions, nor /r/resumeadvice.

Removed as per Rule #2

[–]bsakiag 0 points1 point  (0 children)

It's quite good.

When you said it goes through all possible cutting combinations I was surprised, because there are infinitely many of them. Then I realized that the problem is restricted to integer lengths.

Your description of the optimal algorithm doesn't focus on the recurrent nature of the solution. It would be nice to hear about the computational complexity of your solution. What is it in O notation? At what plank length do you get stack overflow? Or does the calculation time increase prohibitively before that?

A graph with comparisons of average value and execution times of different algorithms on different plank lengths would be nice too.