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

By | August 10, 2015


Lecture 10: Divide and conquer methods, merge sort, exceptions Instructors: Prof. Eric Grimson, Prof. John Guttag View the complete course at: ocw.mit.edu License: Creative Commons BY-NC-SA More information at ocw.mit.edu More courses at ocw.mit.edu

Download PDF

7 thoughts on “Lec 10 | MIT 6.00 Introduction to Computer Science and Programming, Fall 2008

  1. budabudimir3

    Nothing because you use integer dev.

  2. dingyihamigua

    Assume there are N elements.
    if N is odd, usually take (N-1)/2 as the first half and the left as the second half.
    It’s not necessary to have two sublists with the same length.

  3. AlexP91

    Does anyone know what happens if the list is odd when doing a divide and conquer algorithm?

  4. dupreee27

    @jerricogomez its not a space error..its the indentation of subsequent blocks of code that python forces u to use…to get used to it use good text editors as VIM etc..and google around about vim’s python feature…

  5. englishdeerpark

    These videos make programming far more interesting and easy to understand than anything else I’ve tried to learn from. Thank you, MIT.

  6. jerricogomez

    the true is that i like the lecture but python is not a good language to program it has space error, if you type a code and that code is not organize it will give you a error if someone know a better way to deal with python`s space let me know please

  7. heshamwhite

    thank you guys
    this lecture was great

Comments are closed.