-
Notifications
You must be signed in to change notification settings - Fork 2
/
PageAfterExplore.html
69 lines (67 loc) · 2.81 KB
/
PageAfterExplore.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
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<link href="https://fonts.googleapis.com/css?family=Raleway&display=swap" rel="stylesheet">
<link rel="stylesheet" href="css/styles.css" />
<title>Learn Algo</title>
</head>
<body>
<canvas id="canvas"></canvas>
<div id="main">
<div id="header">
<a href="/index.html"><div id="title">Learn Algo</div></a>
</div>
<div id="container">
<div class="algo-container">
<a href="algos/trie/index.html" class="category_link">
<div class="imageContainer">
<img src="assets/trie.jpg" class="image" />
</div>
<div class="description">
<p>Trie</p>
<p>Trie is a type of k-ary search tree used for storing and searching a specific key from a set. Using Trie, search complexities can be brought to optimal limit (key length). </p>
</div>
</a>
</div>
<div class="algo-container">
<a href="algos/bst/index.html" class="category_link">
<div class="imageContainer">
<img src="assets/bst.jpg" class="image" />
</div>
<div class="description">
<p>Binary Search Tree</p>
<p>A binary search tree follows some order to arrange the elements like the value of left node must be smaller than the parent node, and the value of right node must be greater than the parent node.
</div>
</a>
</div>
<div class="algo-container">
<a href="algos/path_finding/index.html" class="category_link">
<div class="imageContainer">
<img src="assets/path.jpg" class="image" />
</div>
<div class="description">
<p>Path Finding Algorithms</p>
<p>Pathfinding algorithms are usually an attempt to solve the shortest and efficient path problems in graph theory. They try to find the best path given a starting point and ending point based on some predefined criteria.
</p>
</div>
</a>
</div>
<div class="algo-container">
<a href="algos/sorting/index.html" class="category_link">
<div class="imageContainer">
<img src="assets/sorting.jpg" class="image" />
</div>
<div class="description">
<p>Sorting Algorithms</p>
<p>Sorting is a process of ordering or placing a list of elements from a collection in some kind of order. It is nothing but storage of data in sorted order. It arranges the data in ascending and descending order which makes searching easier.</p>
</div>
</a>
</div>
</div>
</div>
<script src="particles.js"></script>
</body>
</html>