forked from gcallah/algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Outline2017F.html
144 lines (123 loc) · 3.84 KB
/
Outline2017F.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
<!DOCTYPE html>
<html>
<!-- THIS FILE WAS GENERATED BY A SCRIPT: DO NOT EDIT IT! -->
<head>
<link href="style.css" rel="stylesheet" type="text/css"/>
<title>
Design and Analyis of Algorithms: Course Outline Fall 2017
</title>
</head>
<body>
<div id="header">
<div id="logo">
<img src="graphics/Julia.png">
</div>
<div id="user-tools">
<a href="index.html">Home</a>
<a href="about.html">About</a>
<a href="feedback.html">Feedback</a>
</div>
</div>
<h1>
Design and Analyis of Algorithms: Course Outline Fall 2017
</h1>
<p>
The list below is the plan for
the fall semester of 2017. The plan
may change as we proceed. The names after the numbers are the
chapter names from <i>Introduction to Algorithms</i>, Cormen,
Leiserson, Rivest, and Stein
that correspond to each topic we will
cover. (Note: The numbers in the list are <i>not</i> the
chapter numbers from the textbook, but the order in which we
will cover the material.)
</p>
<ol>
<li>
<a href="TheRoleOfAlgorithms.html">
Introduction
</a>
</li>
<li>
<a href="GettingStarted.html">
Getting Started
</a>
</li>
<li>
<a href="GrowthOfFunctions.html">
Growth of Functions
</a>
</li>
<li>
<a href="DivideAndConquer.html">
Divide-and-Conquer
</a>
</li>
<li>
<a href="Heapsort.html">
Heapsort
</a>
</li>
<li>
<a href="DynamicProgramming.html">
Dynamic Programming
</a>
</li>
<li>
<a href="GreedyAlgorithms.html">
Greedy Algorithms
</a>
</li>
<li>
<a href="BinarySearchTrees.html">
Binary Search Trees
</a>
</li>
<li>
<a href="GraphAlgorithms.html">
Graph Algorithms
</a>
</li>
<li>
<a href="MinimumSpanningTrees.html">
Minimum Spanning Trees
</a>
</li>
<li>
<a href="SingleSourceShortestPaths.html">
Single Source Shortest Paths
</a>
</li>
<li>
<a href="RedBlackTrees.html">
Red-Black Trees
</a>
</li>
<li>
<a href="AugmentingDataStructures.html">
Augmenting Data Structures
</a>
</li>
<li>
<a href="RandomizedAlgorithms.html">
Probabilistic Analysis and Randomized Algorithms
</a>
</li>
<li>
<a href="HashTables.html">
Hash Tables
</a>
</li>
</ol>
</body>
<script>
(function(i,s,o,g,r,a,m){i['GoogleAnalyticsObject']=r;i[r]=i[r]||function(){
(i[r].q=i[r].q||[]).push(arguments)},i[r].l=1*new Date();a=s.createElement(o),
m=s.getElementsByTagName(o)[0];a.async=1;a.src=g;m.parentNode.insertBefore(a,m)
})(window,document,'script','https://www.google-analytics.com/analytics.js','ga');
ga('create', 'UA-97026578-2', 'auto');
ga('send', 'pageview');
</script>
</html>