Alert icon
We're changing our privacy policy. This stuff matters.  Learn more  Dismiss

Lec 5 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005

Loading...

Sign in or sign up now!
32,552
Loading...
Alert icon
Sign in or sign up now!
Alert icon
There is no Interactive Transcript.

Uploaded by on Jan 7, 2009

Lecture 05: Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort

View the complete course at: http://ocw.mit.edu/6-046JF05

License: Creative Commons BY-NC-SA

More information at http://ocw.mit.edu/terms

More courses at http://ocw.mit.edu

Category:

Education

License:

Standard YouTube License

  • likes, 2 dislikes

Link to this comment:

Share to:

Top Comments

  • Man, he explains this so much better than my prof.

  • HIGH QUALITY LECTURE!!!

see all

All Comments (21)

Sign In or Sign Up now to post a comment!
  • do u learn this in unni

    

  • lool ich bin nackt

  • MIT vids are great!

  • great lecture!! Thank u professor...

  • phewww.......now i understand why no. of views keep going down with each passing lecture!!!!!!!!!!

  • 0:02:25 that girl is always late for class .

  • @santiclaus2 why do you say radix sort is not O(n) ? if you double the length of the input does that not double the workload? It seems intuitively obvious to me that the radix sort works in linear time. Looking forward to your response.

  • wow the students are so disrespectful i would kill to go to MIT but it seems like they don't give 2 shits

  • Well, he talks good. A pity that what he says is not true......Radix Sort behaves NOT linear with n. It only seems so. Amazing that teachers like that didn't think only a little bit about what they say....

Loading...

0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more