anonymous
  • anonymous
Hi everyone! I have got question concerning lecture 13 (associated with Ps.8)/ Decision three was introduced. in handout- code was given where decision tree implemented using greedy algorithm so if we input v=[15,10,9,5,20,15,12,1150] w=[12,5,3,4,7,6,5,10] we got answer 24. Which is wrong, so decision tree fails. Can anybody suggest more efficient algorithm of decision tree implementation or better link on source with detailed description/ Thanks in advance!
MIT 6.00 Intro Computer Science (OCW)
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
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.
katieb
  • katieb
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
anonymous
  • anonymous
why was it wrong??
anonymous
  • anonymous
Wrong alert. I found mistake in my implemintation of decision tree, so written alghoritm works good and is efficient. bwCA, thanks for trying to help me.

Looking for something else?

Not the answer you are looking for? Search for more explanations.