-
Notifications
You must be signed in to change notification settings - Fork 13
Expand file tree
/
Copy pathindex.html
More file actions
78 lines (67 loc) · 2.95 KB
/
index.html
File metadata and controls
78 lines (67 loc) · 2.95 KB
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
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<meta http-equiv="X-UA-Compatible" content="ie=edge">
<title> Animated Algorithms </title>
<style>
body {
text-align: center;
}
li {
list-style: none;
margin: 5px;
}
.topic {
font-size: 1.5em;
margin-top: 20px;
}
</style>
</head>
<body>
<h1>Select the algorithm</h1>
<ul>
<li class="topic"> Sorting </li>
<li> <a href="./bubble_sort/">Bubble Sort</a> </li>
<li> <a href="./insertion_sort/">Insertion Sort</a> </li>
<li> <a href="./merge_sort/">Merge Sort</a> </li>
<li> <a href="./quick_sort/">Quick Sort</a> </li>
<li> <a href="./heap_sort/">Heap Sort</a> </li>
<li> <a href="./sorting_network/">Sorting Network</a> </li>
<li class="topic"> Searching </li>
<li> <a href="./sequential_search/">Sequential Search</a> </li>
<li> <a href="./binary_search/">Binary Search</a> </li>
<li class="topic"> Strings </li>
<li> <a href="./lcs/">Longest Common Subsequence</a> </li>
<li> <a href="./markov_chains/">Markov Chains</a> </li>
<li class="topic"> Parsing expressions </li>
<li> <a href="./rpn/">Reverse Polish Notation</a> </li>
<li class="topic"> Graphs </li>
<li> <a href="./dijkstra/">Dijkstra</a> </li>
<li> <a href="./kruscal/">Kruscal</a> </li>
<li> <a href="./prim/">Prim</a> </li>
<li> <a href="./tree_diameter/">Tree diameter</a> </li>
<li> <a href="./lca/">Lowest Common Ancesor</a> </li>
<li class="topic"> Computational Geometry </li>
<li> <a href="./convex_hull/">Convex Hull (Graham Scan)</a> </li>
<li> <a href="./delaunay/">Delaunay Triangulation</a> </li>
<li> <a href="./voronoi/">Voronoi Diagrams</a> </li>
<li> <a href="./voronoi_interactive/">Voronoi Diagrams (interactive)</a> </li>
<li> <a href="./max_circle_problem/">Maximun Circle Problem</a> </li>
<li> <a href="./fourier_transform/">Fourier Transform</a> </li>
<li> <a href="./maurer_rose/">Maurer Rose</a> </li>
<li class="topic"> Neural Networks and Machine Learning </li>
<li> <a href="./linear_regression/">Linear Regression</a> </li>
<li> <a href="./gradient_descent/">Gradient Descent</a> </li>
<li> <a href="./polynomial_approximation_tf/">Polynomial Approximation (TensorFlow.js)</a> </li>
<li> <a href="./xor_problem_tf/"> XOR Problem (TensorFlow.js)</a> </li>
<li> <a href="./perceptron/">Perceptron</a> </li>
<li> <a href="./multilayer_perceptron/">Multilayer Perceptron</a> </li>
<li class="topic"> Others </li>
<li> <a href="./windmill/">The Windmill problem (IMO 2011)</a> </li>
<li> <a href="./electric_field/">Iterative Electric Field</a> </li>
<li> <a href="./coj_3229/">COJ Problem 3229</a> </li>
</ul>
</body>
</html>