CS 371: Module 14: Merge Sort

Module content developed by Professor Tralie. Module engine developed by Professor Tralie and Professor Mongan.


We will now use recursion to design an algorithm that beats the O(N2) worst case complexity bound, using recursion. Please watch the videos below, and be prepared to implement this in class on Monday.

My CS 173 Video on Merge Sort

A dance showing merge sort

Sonification of Merge Sort