CMPS 2200 Introduction to Algorithms
Fall 14
Slides, pictures
Tuesday 8/26/14:
Analyzing algorithms slides,
sorting_insertionSort,
loopInvariant_1,
loopInvariant_2,
totalRuntime_bestCaseInput,
worstCaseInput,
arithmeticSeries,
Thursday 8/28/14:
asymptoticNotation,
asymptoticNotation2,
definitions,
bigOhExamples,
thetaExample,
OhOmegaLemma,
propertiesLittleOh,
limitTheorem,
logs,
Thursday 9/4/14:
summations,
codeSnippet1,
codeSnippet2,
completeBinaryTrees,
dataStructureSupportingMinOperations,
minHeap,
left_right_parent,
minHeap_afterInsertion,
completeBinaryTreeTheorem,
completeBinaryTreeTheorem2,
heapHeight,
Tuesday 9/9/14:
Red-Black Tree slides,
heapEx,
minHeapProperty,
insertEx,
insert_heapifyUp,
extractMin_heapifyDown,
correctnessIdea_heapsort,
extractMinEx,
BSTs,
Thursday 9/11/14:
B-tree slides,
BST_before_rightRotation,
BST_after_rightRotation,
completeTrees,
insertNumbers_unbalancedBST,
BST_node,
computeTreeHeight,
234treeConditions,
split_234treeNode,
Tuesday 9/16/14:
Divide and conquer I slides,
minNumberNodes_btree,
btree_numberOfChildrenAndKeys,
geometricSeries,
deleteNodeInBST,
treeNode,
binaryMinHeap,
dAryMinHeap,
heaps_mergesort,
binarySearchTree,
mergesortRecursiontreeHeight,
solveRecurrenceRecursionTree1,
solveRecurrenceRecursionTree2,
Thursday 9/18/14:
Divide and conquer II slides,
party_9_27_7pm,
convexHullEx,
inductionMergesortRecurrence,
inductionMergesortRecurrence2,
logs,
recursiveSquaring_power,
Tuesday 9/23/14:
multiplication,
power-log-rule,
recursionTree,
matrixMultEx,
Thursday 9/25/14:
Divide and conquer III slides,
mergesortPseudocode,
masterTheoremIntuition,
logs_and_matrixMultRuntime,
examples_1_2,
example_2cont,
moreLogRules,
example_3,
example_4,
Tuesday 9/30/14:
Dynamic Programming slides,
LCS_example,
fibMemoization,
Thursday 10/2/14:
greedy,
makingChange,
makingChange_greedyAlgorithm,
otherCoinDenominations,
optimalSubstructure,
greedyCorrectnessProof_lemma,
greedyCorrectnessProof,
greedyCorrectnessProof2,
makingChangeDP,
makingChangeDP_Ex,
Tuesday 10/8/14:
Btree-node,
knapsack,
knapsackExample,
knapsackGreedyStrategy,
greedyProof,
01knapsackDP,
01knapsackDP_example,
Tuesday 10/14/14:
Graph slides,
project1Extened,
directedGraph,
undirectedGraph,
Thursday 10/16/14:
TestReviewF14,
big-Oh,
BLAST,
Omega,
graph,
Thursday 10/23/14:
tree-dag-connectedGraph,
paths,
DFS-tree,
topSortExample,
Tuesday 10/28/14:
testStats,
findIndex,
DP_and_bTrees,
nodeClass_bTree,
Thursday 10/30/14:
Single-source shortest paths slides,
priorityQueue,
minHeap_decreaseKey,
dijkstra_setS,
Tuesday 11/4/14:
More shortest paths slides,
dijkstraProof,
dijkstraProof2,
negativeCycle,
BellmanFordShortestPath,
Thursday 11/6/14:
MST slides,
Tuesday 11/11/14:
Amortization slides,
Sorting slides (fixed)
nFactorial,
Thursday 11/13/14:
Randomized algorithms slides
inversion,
runtimeInsertionSort,
insertionSortEx,
Tuesday 11/19/14:
project2_steps,
runtimeInsertionSort,
expectedRuntime1,
expectedRuntime2,
quicksort,
Tuesday 11/26/14:
P and NP slides,
P_NP,
independentSetEx,
Tuesday 12/2/14:
dueDates_and_complexityHierarchy,
SAT_formula,
Thursday 12/4/14:
Review for the final exam,
NP_DP_FOSSOPW,
countingSort,
Last modified by Carola Wenk,
cwenk -at- tulane -dot- edu,
