MIT 6.046J / 18.410J Introduction to Algorithms - Fall 2005

Lecture 6: Order Statistics, Median

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: 31685
released under terms of: Creative Commons Attribution Non-Commercial Share Alike (CC-BY-NC-SA)

Switch off the lights

Slides

Related Open Educational Resources

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.

Description

"Today we're going to not talk about sorting. This is an exciting new development. We're going to talk about another problem, a related problem, but a different problem. We're going to talk about another problem that we would like to solve in linear time. Last class we talked about we could do sorting in linear time. To do that we needed some additional assumptions. Today we're going to look at a problem that really only needs linear time, even though at first glance it might look like it requires sorting. So this is going to be an easier problem. The problem is I give you a bunch of numbers..."

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:

1 vivac, November 25, 2011 at 10:24 p.m.:

This is just fantastic. Thank you so much. A fabulous way to go through my favorite algorithms book!

2 Ryan, May 14, 2019 at 10:38 a.m.:

I am happy to see that http://newcheat.net/imvu brings me free imvu credits online.

Write your own review or comment:

Comment:
Name:
Email address:
URL:

make sure you have javascript enabled or clear this field: