A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 5 years ago
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!
anonymous
 5 years ago
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!

This Question is Closed

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0Wrong 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.
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.