Lec 10 | MIT 6.00 Introduction to Computer Science and Programming, Fall 2008

Lecture 10: Divide and conquer methods, merge sort, exceptions

Instructors: Prof. Eric Grimson, Prof. John Guttag

View the complete course at: http://ocw.mit.edu/6-00F08

License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu

Category:

Education

Tags:

• computer
• programming
• Python
• science
• computation
• problem
• solving
• recursion
• binary
• search
• classes
• inheritance
• libraries
• algorithms
• optimization
• problems
• modules
• simulation
• big-O-notation
• control
• flow
• exceptions
• building
• computational
• models
• software
• engineering

[MasterFuck3000]

why is everybody using macs and linux?

[ronmexico00]

@kopilatis10 there's a link for 'download course materials'

all the handouts are included in the download

[joebobjoesayshi]

@kharrell904 It was a function above, he showed it briefly.

[kharrell904]

I understand how the list gets broken all the way down the left side to the base case, and then the we go back up to the right side of the sublist and break that down. I also understand how the code merges the two numbers when you get down to the base case. But where in the code do you take the two merged lists and merge them? I'm at 13:45 - 14:45.

[agapitoflores001]

This is what you call the real Science! Great!

[hack3Rtub3]

Found this video by searching: "i'd expected somehow better", lol...

[ScionPratik]

great if u dont have much money to study in mit but u can attend classes for free

[timfoil740]

When I try to do the insert function after I do the create function I get a type error: TypeError: object doesn't support item assignment

Can someone please explain what is going wrong?

[luckyranger94]

awesome course and taught in a very way, thanks

[ntwiles]

"been a long day".