Design and Analysis of Algorithms

CS-GY 6033 Prof. Linda Sellie

Introduction to Algorithms, 4th Edition, Cormen, Leiserson, Rivest, and Stein

  • Data structures: priority queues, hasing, binary search trees, balanced search trees, B-trees

  • Searching and sorting: heapsort, quicksort, sorting in linear time, medians and order statistics

  • Divide-and-conquer algorithms: Karatsuba's algorithm, Strassesn's algorithm, Closest-pair problem

  • Graph algorithms: BFS, DFS, topological sort, connected components, strongly connected components, minimum spanning trees, shortest paths

  • Union Find

  • Dynamic programming: rod cutting, matrix chain product, LCS

  • Greedy Algorithms: activity selection, huffman coding

  • NP-completeness

Last updated