CSE-830

Code and course material for MSU's "CSE 830: Design and Theory of Algorithms"

CSE 830: Design & Theory of Algorithms

Documents for CSE 830 - Week 2

Starting: 9/7

Pre-class videos for Tuesday, Sept. 8

Using the RAM Model (17:51)

Divide and Conquer (10:14)

Asymptotic Notation (18:36)

Graphing Code Results (11:30)


Optional extra videos:

“Live” Coding: Insertion Sort Algorithm (54:54)

“Live” Coding: Other Sorting Algorithms (53:08)


Pre-class videos for Thursday, Sept. 10

Proving Asymptotic Bounds on Insertion Sort (7:21)

Proving Asymptotic Bounds on Mergesort (18:09)

Recurrance Relations (16:21)