MIT OpenCourseWare http://ocw.mit.edu 6.006 Introduction to Algorithms Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.6.006 Recitation Build 2008.2Outline • Introductions • Document Distance -- What It Is • Python CodeWhy Algorithms? • Pwn interviews • Keep your brain in shape • Build better systems • Save the worldWord from our Sponsors • Do not copy someone else’s code •Document Distance • Big Intimidating Mathy Metric • Comes down to • For each word W in both docs • Q = number of occurrences in doc 1 • R = number of occurrences in doc 2 • Sum up Q * RDaily Python: Lists • fruits = [‘cat’,‘window’,‘defenestration’] • fruits[1] • fruits[1] = ‘wall’ • fruits + [‘lawsuit’] • fruits.append(‘lawsuit’) •
View Full Document
Unlocking...