-
Notifications
You must be signed in to change notification settings - Fork 54
/
index.html
352 lines (335 loc) · 10.4 KB
/
index.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
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
<!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 Analysis of Algorithms
</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 class="toc-head">
Design and Analysis of Algorithms
</h1>
<figure class="toc-fig">
<img
src="https://upload.wikimedia.org/wikipedia/commons/d/d6/Finite_subdivision_of_a_radial_link.png"
height="160" width="160"><img
src="https://upload.wikimedia.org/wikipedia/commons/d/d6/Finite_subdivision_of_a_radial_link.png"
height="160" width="160"><img
src="https://upload.wikimedia.org/wikipedia/commons/d/d6/Finite_subdivision_of_a_radial_link.png"
height="160" width="160"><img
src="https://upload.wikimedia.org/wikipedia/commons/d/d6/Finite_subdivision_of_a_radial_link.png"
height="160" width="160">
<figcaption>
"The best programs are written so that computing
machines can perform them quickly and so that
human beings can understand them clearly. A
programmer is ideally an essayist who works with
traditional aesthetic and literary forms as well
as mathematical concepts, to communicate the way
that an algorithm works and to convince a reader
that the results will be correct." -- Donald Knuth
</figcaption>
</figure>
<div style="text-align:center">
<hr>
<h2>
I. Foundations
</h2>
<details>
<summary class="menu_sum">
Chapters
</summary>
<h3>
<a href="TheRoleOfAlgorithms.html">
1. The Role Of Algorithms
</a>
</h3>
<h3>
<a href="GettingStarted.html">
2. Getting Started
</a>
</h3>
<h3>
<a href="GrowthOfFunctions.html">
3. Growth Of Functions
</a>
</h3>
<h3>
<a href="DivideAndConquer.html">
4. Divide And Conquer
</a>
</h3>
<h3>
<a href="RandomizedAlgorithms.html">
5. Randomized Algorithms
</a>
</h3>
</details>
<h2>
II. Sorting And Order Statistics
</h2>
<details>
<summary class="menu_sum">
Chapters
</summary>
<h3>
<a href="Heapsort.html">
6. Heapsort
</a>
</h3>
<h3>
<a href="Quicksort.html">
7. Quicksort
</a>
</h3>
<h3>
<a href="SortingInLinearTime.html">
8. Sorting In Linear Time
</a>
</h3>
<h3>
<a href="MediansAndOrderStatistics.html">
9. Medians And Order Statistics
</a>
</h3>
</details>
<h2>
III. Data Structures
</h2>
<details>
<summary class="menu_sum">
Chapters
</summary>
<h3>
<a href="ElementaryDataStructures.html">
10. Elementary Data Structures
</a>
</h3>
<h3>
<a href="HashTables.html">
11. Hash Tables
</a>
</h3>
<h3>
<a href="BinarySearchTrees.html">
12. Binary Search Trees
</a>
</h3>
<h3>
<a href="RedBlackTrees.html">
13. Red Black Trees
</a>
</h3>
<h3>
<a href="AugmentingDataStructures.html">
14. Augmenting Data Structures
</a>
</h3>
</details>
<h2>
IV. Advanced Design And Analysis Techniques
</h2>
<details>
<summary class="menu_sum">
Chapters
</summary>
<h3>
<a href="DynamicProgramming.html">
15. Dynamic Programming
</a>
</h3>
<h3>
<a href="GreedyAlgorithms.html">
16. Greedy Algorithms
</a>
</h3>
<h3>
<a href="AmortizedAnalysis.html">
17. Amortized Analysis
</a>
</h3>
</details>
<h2>
V. Advanced Data Structures
</h2>
<details>
<summary class="menu_sum">
Chapters
</summary>
<h3>
<a href="BTrees.html">
18. B Trees
</a>
</h3>
<h3>
<a href="FibonacciHeaps.html">
19. Fibonacci Heaps
</a>
</h3>
<h3>
<a href="vanEmdeBoasTrees.html">
20. van Emde Boas Trees
</a>
</h3>
<h3>
<a href="DataStructuresForDisjointSets.html">
21. Data Structures For Disjoint Sets
</a>
</h3>
</details>
<h2>
VI. Graph Algorithms
</h2>
<details>
<summary class="menu_sum">
Chapters
</summary>
<h3>
<a href="GraphAlgorithms.html">
22. Graph Algorithms
</a>
</h3>
<h3>
<a href="MinimumSpanningTrees.html">
23. Minimum Spanning Trees
</a>
</h3>
<h3>
<a href="SingleSourceShortestPaths.html">
24. Single Source Shortest Paths
</a>
</h3>
<h3>
<a href="AllPairsShortestPaths.html">
25. All Pairs Shortest Paths
</a>
</h3>
<h3>
<a href="MaximumFlow.html">
26. Maximum Flow
</a>
</h3>
</details>
<h2>
VII. Selected Topics
</h2>
<details>
<summary class="menu_sum">
Chapters
</summary>
<h3>
<a href="MultithreadedAlgorithms.html">
27. Multithreaded Algorithms
</a>
</h3>
<h3>
<a href="MatrixOperations.html">
28. Matrix Operations
</a>
</h3>
<h3>
<a href="LinearProgramming.html">
29. Linear Programming
</a>
</h3>
<h3>
<a href="PolynomialsAndTheFFT.html">
30. Polynomials And The F F T
</a>
</h3>
<h3>
<a href="NumberTheoreticAlgorithms.html">
31. Number Theoretic Algorithms
</a>
</h3>
<h3>
<a href="StringMatching.html">
32. String Matching
</a>
</h3>
<h3>
<a href="ComputationalGeometry.html">
33. Computational Geometry
</a>
</h3>
<h3>
<a href="NPCompleteness.html">
34. N P Completeness
</a>
</h3>
<h3>
<a href="ApproximationAlgorithms.html">
35. Approximation Algorithms
</a>
</h3>
</details>
<hr>
<h2>
Other Material
</h2>
<h3>
<a href="Outline2017F.html">
Course Outline Fall 2017
</a>
</h3>
<h3>
<a href="TAHours.html">
TA Hours Fall 2017
</a>
</h3>
<h3>
<a href="Homework/Fall2017/index.html">
Homework with answers, Fall 2017
</a>
</h3>
<h3>
<a
href="tests/index.html">
Past Tests
</a>
</h3>
<h3>
<a href="AlgorithmMuseum.html">
The Algorithm Museum
</a>
</h3>
<h3>
<a href="GreedyVsDynamic/index.html">
Greedy Versus Dynamic Programming
</a>
</h3>
<h3>
<a href="https://gcallah.github.io/Algocynfas/">
Algocynfas
</a>
</h3>
<h3>
<a href="https://github.com/gcallah/algorithms">
GitHub Repository
</a>
</h3>
</div>
</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>