CSE331 Introduction to Algorithms

Insertion sort

Asymptotic notations

Merge Sort and Binary Search

Solving recurrences

Matrix multiplication

Closest pair of points

Quicksort

The Selection problem

Can we sort in linear time?

Introduction to Dynamic Programming

The Rod Cutting Problem

Longest common subsequence

Optimal binary search trees

Review of elementary graph algorithms and data structures

Minimum spanning trees

Dijkstra’s algorithm

Introduction to Computational Complexity