12. Searching and Sorting 

Exactly! The less knowledgeable the more arrogant

42:12 merge isn’t logn iterations its at least n iterations and at most 2n iterations. You can see at 39:49 that number of prints(iterations) isn’t logn. 37:32 we aren’t cutting down the problem in half, it’s a tree 40:33. It’s logn levels of iterations(not iterations themselves) where iterations at each level together have O(n) complexity(cost of each step(iteration) is O(n) but turns out that cost of steps at same level of a tree is also O(n) 41:24. He just mixes levels with steps 42:04 Normally what we do is we multiply number of steps(O(n->2n)) to their complexity(O(n)) but in this case we use the fact that at each LEVEL of a tree sum of conplexity of steps is O(n). So number of LEVELS in a tree (O(logn)) multipled with each level’s complexity(O(n)) = O(nlogn)

@@JH-ux1re Perfectly explains his sentiments around the political divide.

​@@JH-ux1re😢😊😊

same here

same game (c) Prof. Grimson

Can u share the playlist link

@@kannammapoona8064 I'm late but it's /playlist?list=PLUl4u3cNGP63WbdFxL8giv4yhgdMGaZNA

I do agree

Lei Xun thanks

Thanks for the handy time stamps.

garbge

They didn't record these in 1 day?

It looks like they recorded these videos in one day.

@@mvisperas so the students are actors?

@@kneerelief577 It means all the videos were shot in one day. Thus, their clothes appear to be the same. In game shows like Jeopardy, the host and the contestants bring different clothes so it appears the next show is actually the next day. The MIT videos are aimed at teaching, not vanity.

more like geller

there is one more MIT OCW course called introduction to algorithms

See ocw.mit.edu/courses/find-by-topic/#cat=engineering&subcat=computerscience&spec=algorithmsanddatastructures to see what we have for algorithms. Best wishes on your studies!

No more lectures after this one. See the course on MIT OpenCourseWare for more details at ocw.mit.edu/6-0001F16.

there is a follow up course which is 6.0002

Here's the playlist for the series: ru-vid.com/group/PLUl4u3cNGP63WbdFxL8giv4yhgdMGaZNA. For more info, see the course on MIT OpenCourseWare at: ocw.mit.edu/6-0001F16. Best wishes on your studies!

Looking at course on MIT OpenCourseWare ( ocw.mit.edu/6-0001F16 ), it doesn't look like it. We do know that the equivalent of 6.001 will be starting on EdX in late August (26th). It will have a final exam (which can even be graded if you sign up for a certificate): www.edx.org/course/introduction-to-computer-science-and-programming-7. There is an older version that has an exam (with solution) but it is based on an earlier version of Python and might not be as helpful: ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-00sc-introduction-to-computer-science-and-programming-spring-2011/unit-3/final-exam/

ru-vid.com/group/PLUl4u3cNGP63WbdFxL8giv4yhgdMGaZNA

go to website

Yes. For more info and materials, see the course on MIT OpenCourseWare at: ocw.mit.edu/6-0001F16. Best wishes on your studies!

Very useful. Thanks!

Python (v3.5). For more information and materials, see the course on MIT OpenCourseWare at: ocw.mit.edu/6-0001F16. Best wishes on your studies!

Playlist for the course:ru-vid.com/group/PLUl4u3cNGP63WbdFxL8giv4yhgdMGaZNA Course materials: ocw.mit.edu/6-0001F16 Best wishes on your studies!