Directory Tree

.
├── Chapter3.pdf
├── Chapter5.pdf
├── How to Think About Algorithms - Iterative.pptx
├── How to Think About Algorithms - Marketing Excerpt.pdf
├── How to Think About Algorithms - Recursion.pptx
├── RecursiveRectangles.mp4
├── algs4.mp4
├── demos
│   ├── 13DemoDijkstraTwoStack.mov
│   ├── 13DemoDijkstraTwoStack.pdf
│   ├── 14DemoBinarySearch.pdf
│   ├── 15DemoQuickFind.mov
│   ├── 15DemoQuickUnion.mov
│   ├── 15DemoQuickUnion.pdf
│   ├── 21DemoInsertionSort.mov
│   ├── 21DemoInsertionSort.pdf
│   ├── 21DemoKnuthShuffle.mov
│   ├── 21DemoKnuthShuffle.pdf
│   ├── 21DemoSelectionSort.mov
│   ├── 21DemoSelectionSort.pdf
│   ├── 22DemoMerge.mov
│   ├── 22DemoMerge.pdf
│   ├── 23DemoPartitioning.pdf
│   ├── 23DemoPartitioningDijkstra.pdf
│   ├── 24DemoBinaryHeap.mov
│   ├── 24DemoBinaryHeap.pdf
│   ├── 24DemoHeapsort.mov
│   ├── 24DemoHeapsort.pdf
│   ├── 32DemoBinarySearchTree.mov
│   ├── 32DemoBinarySearchTree.pdf
│   ├── 33Demo23Tree.mov
│   ├── 33DemoRedBlackBST.mov
│   ├── 33DemoRedBlackBST.pdf
│   ├── 34DemoLinearProbingHashTable.mov
│   ├── 41DemoBreadthFirstSearch.mov
│   ├── 41DemoConnectedComponents.mov
│   ├── 41DemoDepthFirstSearch.mov
│   ├── 42DemoDepthFirstSearch.mov
│   ├── 42DemoKosarajuSharir.mov
│   ├── 42DemoTopologicalSort.mov
│   ├── 43DemoGreedy.pdf
│   ├── 43DemoKruskal.pdf
│   ├── 43DemoPrim.pdf
│   ├── 44DemoAcyclicSP.pdf
│   ├── 44DemoBellmanFord.pdf
│   ├── 44DemoDijkstra.pdf
│   ├── 51DemoKeyIndexedCounting.pdf
│   ├── 52DemoTST.mov
│   ├── 52DemoTrie.mov
│   ├── 53DemoDFA.pdf
│   ├── 53DemoKnuthMorrisPratt.mov
│   ├── 53DemoKnuthMorrisPratt.pdf
│   ├── 54DemoConstructionNFA.mov
│   ├── 54DemoSimulationNFA.mov
│   ├── 55DemoHuffman.mov
│   ├── 55DemoLZW.mov
│   ├── 64DemoFordFulkerson.mov
│   ├── 64DemoFordFulkerson.pdf
│   ├── 99DemoGrahamScan.pdf
│   ├── 99DemoIntervalSearchTree.mov
│   ├── 99DemoIntervalSearchTree.pdf
│   ├── 99DemoKdTree.mov
│   └── 99DemoKdTree.pdf
├── ds1.zip
├── eclipse-problems.mp4
├── eclipse.mp4
├── index.html
├── jim-marshall-BigO
│   ├── cubic.gif
│   ├── dominant1.gif
│   ├── dominant2.gif
│   ├── dominant3.gif
│   ├── index.html
│   ├── linear.gif
│   ├── log-vs-cubic1.gif
│   ├── log-vs-cubic2.gif
│   ├── polynomials.gif
│   ├── primality1.gif
│   ├── primality2.gif
│   ├── primality3.gif
│   ├── primality4.gif
│   ├── quadratic.gif
│   ├── running-times.gif
│   └── sorting.gif
├── lectures
│   ├── 00Intro.pdf
│   ├── 13StacksAndQueues.pdf
│   ├── 14AnalysisOfAlgorithms.pdf
│   ├── 15UnionFind.pdf
│   ├── 21ElementarySorts.pdf
│   ├── 22Mergesort.pdf
│   ├── 23Quicksort.pdf
│   ├── 24PriorityQueues.pdf
│   ├── 31ElementarySymbolTables.pdf
│   ├── 32BinarySearchTrees.pdf
│   ├── 33BalancedSearchTrees.pdf
│   ├── 34HashTables.pdf
│   ├── 35SearchingApplications.pdf
│   ├── 41UndirectedGraphs.pdf
│   ├── 42DirectedGraphs.pdf
│   ├── 43MinimumSpanningTrees.pdf
│   ├── 44ShortestPaths.pdf
│   ├── 51StringSorts.pdf
│   ├── 52Tries.pdf
│   ├── 53SubstringSearch.pdf
│   ├── 54RegularExpressions.pdf
│   ├── 55DataCompression.pdf
│   ├── 64MaxFlow.pdf
│   ├── 65Reductions.pdf
│   ├── 67CombinatorialSearch.pdf
│   ├── 99GeometricPrimitives.pdf
│   ├── 99GeometricSearch.pdf
│   └── 99LinearProgramming.pdf
├── mydeque-main.txt
├── mydeque-trace.pdf
└── mydeque-trace.zip


3 directories, 113 files


tree v1.7.0 © 1996 - 2014 by Steve Baker and Thomas Moore
HTML output hacked and copyleft © 1998 by Francesc Rocher
JSON output hacked and copyleft © 2014 by Florian Sesser
Charsets / OS/2 support © 2001 by Kyosuke Tokoro