Ask your own question, for FREE!
MIT 6.00 Intro Computer Science (OCW) 16 Online
OpenStudy (anonymous):

Am I reading this correctly? http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-00sc-introduction-to-computer-science-and-programming-spring-2011/unit-3/lecture-20-more-clustering/ The ps9 solution is talking about a different topic than the assignment outline. Something about counties?

OpenStudy (anonymous):

yep, looks like they messed up - do you need a solution?

OpenStudy (anonymous):

I would appreciate one. It would enable me to evaluate how well I accomplished the problem set.

OpenStudy (anonymous):

i did the 2008 course which had an extra problem dPAdvisor - u can ignore that. there is an xtra function in there for greedy that is pretty fast - turned the dictionary to a list, sorted the list then picked 'the best' - i like that one. cmpRatio seems to give results consitent with bruteforce. hmm, my bruteforce may not be working - will update later here are the results for greedy http://dpaste.com/801709/ code: http://dpaste.com/801707/

OpenStudy (anonymous):

Thanks! I'm sure it will help. I'm looking through it now.

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!