CMPS 2200 Introduction to Algorithms
Fall 15
Slides, pictures
Monday 8/24/15:
Analyzing algorithms slides,
insertionSort-1,
insertionSort-2_3,
Wednesday 8/26/15:
runtimeAnalysis-RAM,
runtimeAnalysis-RAM2,
arithmeticSeries,
asymptoticNotation,
bigOh,
Friday 8/28/15:
bigOh-examples,
bigOh-examples2,
bigOh-examples3,
Omega,
Theta_littleOh,
littleOh_limitTheorem,
Monday 8/31/15:
log_theta,
limitThmEx,
codeSnippets1,
codeSnippets2,
runtimeNestedLoops_Summations,
Wednesday 9/2/15:
priorityQueue_implementations,
stack_queue_minHeap,
completeBinaryTrees,
heapExample,
left_right_parent,
insertionEx,
Friday 9/4/15:
insertEx,
insert_heapifyUp,
insert_correctness,
extractMinEx,
extractMin_heapifyDown,
extractMin_holeWrongPos,
extractMin_correctness,
Wednesday 9/9/15:
Red-Black Tree slides,
annotations,
BST_deleteNode,
BSTProperty_completeTrees,
binaryTree_internalNodes_Leaves,
binaryTree_nodesLeavesThm
Friday 9/11/15:
homeworkCodeSnippet,
nodesLeavesThm1,
nodesLeavesThm2,
valid_vs_nonValid_RBTrees,
rotation,
Monday 9/14/15:
B-Tree slides,
unbalancedBST,
completeBinaryTrees,
Wednesday 9/16/15:
bst_minHeap_bTree,
bTreeNode,
bTree_numChildren_numKeys,
Friday 9/18/15:
Divide-and-conquer I slides,
officeHours,
mergeSort,
BTree-demo,
Monday 9/21/15:
Divide-and-conquer II slides,
officeHours,
matrixMult,
powering1,
powering2,
Thursday 9/24/15:
matrixMultEx,
Strassen,
recursionTreeEx,
powers,
StrassenEx1,
StrassenEx2,
Friday 9/25/15:
Divide-and-conquer III slides,
divideMatrix-evenOdd1,
alternativeDivision,
masterTheoremEx1,
masterTheoremEx1,
Wednesday 9/30/15:
recursionTree,
masterThm,
masterThm2,
masterThm3,
Friday 10/2/15:
Dynamic programming slides,
fibMemoization,
lcs,
Monday 10/5/15:
midterm,
LCS_length,
printLCS,
Wednesday 10/7/15:
Frechet slides,
polynomials,
freeSpaceCell,
reachabilityPropagation,
Friday 10/9/15:
greedyAlgorithms,
makingChange,
otherCoinDenominations,
makingChangeRec,
optimalSubstructure,
greedyCorrectness1,
greedyCorrectness2,
DP,
Monday 10/12/15:
makingChangeRecursion,
makingChangeEx,
makingChangeEx2,
Wednesday 10/14/15:
needToKnowForMidterm,
needNotToKnowForMidterm,
recurrence,
Monday 10/19/15:
Midterm review,
bst,
bstAfterLeftRotation,
Btree,
BtreeAfterInsertion,
masterThmCase3,
Wednesday 10/21/15:
Graph slides,
LCS,
LCS_bottomUp,
graphs,
verticesEdgesEx,
verticesEdgesEx,
Friday 10/24/15:
adjMatrix_and_list,
graphEx_degrees,
Monday 10/26/15:
DFS_edge_classificationEx,
paths_cycle,
Wednesday 10/28/15:
Shortest paths slides,
connectedComponents,
DAG,
Monday 11/2/15:
More shortest paths slides,
loop,
Wednesday 11/2/15:
floydWarshallEx,
Friday 11/4/15:
MST slides,
Monday 11/9/15:
Amortization slides,
runtime,
Wednesday 11/11/15:
Union-Find slides,
queue_unionFind,
binaryCounter,
Friday 11/13/15:
trees_depth_height,
Ackermann1,
Ackermann,
inverseAckermann,
Monday 11/16/15:
Sorting slides,
factorial,
insertionSort_countingSort,
Wednesday 11/18/15:
Probability and expectation slides,
Randomized algorithms slides,
insertionSort,
graphDirected,
primEx,
Friday 11/20/15:
insertionSort,
inversions,
linearityOfExpectation,
expectedRuntime1,
expectedRuntime2,
expectedRuntime3,
Monday 11/23/15:
homeworks,
log_10over9,
nestedTrees,
Monday 11/30/15:
P and NP slides,
day //15:
cheatSheet,
randQuicksortAnalysis1,
randQuicksortAnalysis2,
randQuicksortAnalysis3,
Wednesday 12/2/15:
Final review,
inputForClique,
P_NP,
Last modified by Carola Wenk,
cwenk -at- tulane -dot- edu,
