Chengwei LEI

CMPS 3120 Algorithm Analysis

	^{Book Chapter}	^Topics
	^{Chapter 0}	^{About this class}
^I	^{Chapter 1}	^Introduction
	^{Chapter 2}	^{Analysis of Algorithm Efficiency}
	^{Chapter 3}	^{Brute Force and Exhaustive Search}
^II	^{Chapter 5}	^{Divide and Conquer}
	^{Chapter 4}	^{Decrease and Conquer}
	^{Chapter 6}	^{Transform and Conquer (AVL trees / 2-3 trees / Heap)}
^III	^{Chapter 7}	^{Space and Time Trade-offs} ^{(String Searching / Hashing)}
	^{Chapter 9}	^{Greedy Algorithms}
	^{Chapter 8}	^{Dynamic Programming}