MIT Sort related online courses

Leave a comment

May 15, 2016 by oneOokay

MIT Sort related online courses:


3. Insertion Sort & Merge Sort:

  • insertion sort: n2
  • in-place insertion sort – needs theta(1) auxiliary space. (insertion sort’s advantage over merge sort)
  • merge sort: nlogn  –  needs theta (n) auxiliary space
  • in-place merge sort : it does exist but is way more complicated. dont bother use it.


4. Heaps and Heap Sort


5. Binary Search Trees & BST Sort


6. AVL Trees & AVL Sort


7. Counting Sort & Radix Sort & Lower Bounds for Sorting

8. Hashing with Chaining






Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: