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!

Question

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 · Answer

why was it wrong??

anonymous · Answer

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.