MA 5007: Algorithm I, Spring 2026

Slides

• [Foundation]

• [Sorting & order statistics]

Grading: exam 33.33% x 3

Schedule (16 + 12 + 11= 39 hr)

• Week 1 practice 1

  • Feb 24 [Foundation] Syllabus, what is algorithm, insertion sort

  • Feb 26 Big O notation

• Week 2 practice 2

  • Mar 03 Divide-and-conquer, merge sort

  • Mar 05 Strassens' algorithm, solving recurrences

  • coding practice: merge sort

• Week 3 practice 3

  • Mar 10 [Sorting & order statistics] Heap

  • Mar 12 Heapsort, Quicksort

  • coding practice: heapsort

• Week 4

  • Mar 17 

  • Mar 19 Sorting in linear time, medians and order statitics

• Week 5

  • Mar 24

  • Mar 26 [DP & greedy] Dynamic Programming (DP)

• Week 6

  • Mar 31

  • Apr 02 No class

• Week 7

  • Apr 07 Dynamic Programming (DP)

  • Apr 09 Exam 1

• Week 8

  • Apr 14

  • Apr 16 Greedy algorithms

• Week 9

  • Apr 21

  • Apr 23 Greedy algorithms  

• Week 10

  • Apr 28

  • Apr 30 [Graph algorithms] Breadth First Search (BFS)

• Week 11

  • May 05

  • May 07 Depth First Search (DFS)

• Week 12

  • May 12

  • May 14 Exam 2

• Week 13

  • May 19

  • May 21 [Shortest Paths] Dijkstra's, Bellman-Ford, DAG

• Week 14

  • May 26

  • May 28 [Minimum Spanning Tree]

• Week 15

  • Jun 02

  • Jun 04 [NP-completeness]

• Week 16

  • Jun 09

  • Jun 11 Exam 3