Lecture 1: Administrivia, Introduction, Analysis of Algorithms, Insertion Sort, Mergesort

author: Charles E. Leiserson, Department of Brain and Cognitive Sciences, Massachusetts Institute of Technology, MIT
recorded by: Massachusetts Institute of Technology, MIT
published: Feb. 10, 2009,   recorded: September 2005,   views: 27173
released under terms of: Creative Commons Attribution Non-Commercial Share Alike (CC-BY-NC-SA)

Slides

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Bibliography

Description

"We're going to get started. Handouts are the by the door if anybody didn't pick one up. My name is Charles Leiserson. I will be lecturing this course this term, Introduction to Algorithms, with Erik Demaine. In addition, this is an SMA course, a Singapore MIT Alliance course which will be run in Singapore by David Hsu. And so all the lectures will be videotaped and made available on the Web for the Singapore students, as well as for MIT students who choose to watch them on the Web. If you have an issue of not wanting to be on the videotape, you should sit in the back row. OK? Otherwise, you will be on it..."

See Also:

Download slides icon Download slides: mit6046jf05_leiserson_lec01_01.pdf (501.3 KB)

Download Video - generic video source Download mit6046jf05_leiserson_lec01_01.m4v (Video - generic video source 166.9 MB)

Download Video - generic video source Download mit6046jf05_leiserson_lec01_01.rm (Video - generic video source 128.9 MB)

Download Video Download mit6046jf05_leiserson_lec01_01.flv (Video 224.2 MB)

Download Video Download mit6046jf05_leiserson_lec01_01.wmv (Video 702.5 MB)

Download audio transcript Download mit6046jf05_leiserson_lec01_01.mp3 (Audio lecture 18.6 MB)


Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Reviews and comments:

Comment1 rara, July 9, 2009 at 12:24 p.m.:

great!;)


Comment2 fizolahi, July 9, 2009 at 9:40 p.m.:

hi
i com from in iran. i student university tehran
i field computer scince

by


Comment3 Bingcan Xu, September 22, 2009 at 6:27 p.m.:

nice place...
I am learning algorithms,
Have a nice day!


Comment4 calvin, October 3, 2009 at 4:21 a.m.:

It fulfills my inferiorities.
And gives me some kind of narcissism.
In aspect of psychology,

Oops, I've watched psychology lectures just before.


Comment5 Philip, October 17, 2009 at 3:37 p.m.:

How can you get to work done in recitation.


Comment6 Modrock, November 12, 2009 at 5:08 a.m.:

Hello cute blond girl in the front row! I'd be throwing paper airplanes if I could.


Comment7 Nicky, January 18, 2010 at 3:54 p.m.:

I am learning through your notes.... Its nice.{college student }


Comment8 samir, January 27, 2010 at 7:49 a.m.:

Thanks a lot for these nice lectures, keeping us in touch with that wonderful MIT generosity.
God bless you.


Comment9 Fernando, July 25, 2010 at 10:32 a.m.:

Thanks MIT, Im from Chile, great material! , I'm feel like a student again


Comment10 Tom, September 23, 2010 at 6:19 a.m.:

I just wanted to say thank you very much to professor Leiserson and to MIT for posting this material. Your lectures are clear and thorough. This will certainly help me this semester.


Comment11 Tran Dang Hoa, April 15, 2011 at 2:02 p.m.:

How do I see the subtitle of this video lecture??
Thanks!


Comment12 Sendagire Joseph, April 21, 2011 at 12:38 p.m.:

thanks for this important setup. its helping students im sure. Im a student at Kampala university doing my second year, first sem of my Dip. computer science and information technology. please continue. thanks


Comment13 Shamsher khan, May 24, 2011 at 8:50 p.m.:

Very nice material.thnx..helping too much in my studies .. ( i'm MCA Student)


Comment14 Kamran, November 15, 2011 at 2:14 p.m.:

thanks ,
it is a nicest job done by video lectures ,
helping me a lot in learning algorithms


Comment15 ramin, April 21, 2012 at 8:27 a.m.:

hi
i have read clrs book,
i decision watch these videos
tnx:D


Comment16 Jarrett Mattson, June 18, 2012 at 11:59 a.m.:

Pretty much worthless. Keeps crashing on me and stalling out. How ironic.


Comment17 abhishek pandey, August 2, 2013 at 2:03 p.m.:

how to download these lecture


Comment18 Narayan Ramamurthi, June 28, 2014 at 3:03 a.m.:

Hello Sir,

First: Let me introduce myself. I am Narayan R from Hyderabad, India. I work in a software company. I have applied for admission into PhD from IIIT hyderabad - hoping that I can get it.

Second: Some feed back on these lectures - Very nice lectures. They really help me to bridge the 10 years gap that I have had after doing my Masters in Computer Applications.

Third: A question.

The running time also depends on the data structure being used.

For example, if the same insertion sort were done using arrays versus it were done using doubly linked list.

When we are using an array, the running time depends on the number of elements we are required to move to make an insertion.

But, when we are using a doubly linked list, this is not necessarily so true because we dont move elements around to make an insertion.

Isnt it?

- Narayan


Comment19 Veningston, August 11, 2016 at 12:51 p.m.:

Even array is going to be stored as linked list internally... That does not make any sense with respect to algorithm analysis...

Write your own review or comment:

make sure you have javascript enabled or clear this field: