CSE 373 : Analysis of Algorithms

Quiz : Quiz

Course Website : http://www3.cs.stonybrook.edu/~skiena/373/

Course Textbook : The_Algorithms_Design_Manual_(Second_Edition)

Video Lectures : http://www3.cs.stonybrook.edu/~algorith/video-lectures/

i=1Σn n = n(n+1)/2

i=1Σn-1 n = n(n-1)/2

Build Heap : O(n)

DFS on UndirectedGraph make Trémaux tree (tree edges + back edges)

Problem 1-5

Problem 2-7 Problem 2-8 Problem 2-19 Problem 2-20 Problem 2-21 Problem 2-22 Problem 2-23 Problem 2-24

Problem 3-2 Problem 3-4 Problem 3-10 Problem 3-11

Problem 4-1 Problem 4-3 Problem 4-6 Problem 4-44

Problem 6-22

Problem 7-2

Problem 8-7

HW3 HW4