./../../private/data/10/header.jpg ./../../private/data/10/header2.jpg ./../../private/data/10/header3.jpg

Module 10 - nLogn Sorts and How We Prove It

Audio/Video Recording

Audio Recordings are posted after class within a youtube playlist. Occasionally technical errors happen, but I do my best to post recordings as soon as possible to a playlist.

The full course playlist is here: Course Youtube Playlist

Module Content

Module Overview

In this module we learn about nLog(N) sorts!

Module Outline

  • Lecture outline
    • Recursion in C -- Countdown and iteration
    • How to beat N-Squared? Divide and Conquer
    • How to beat N-Squared? Merge Sort and Recurrence
    • Randomized Algorithms - Quicksort
Please do not redistribute or host any materials without e-mailing me first. I generally am happy to share the latest .pdf or slide presentation with those who ask. Thank you for your time!