-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathbeginner.html
More file actions
91 lines (85 loc) · 4.09 KB
/
beginner.html
File metadata and controls
91 lines (85 loc) · 4.09 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
79
80
81
82
83
84
85
86
87
88
89
90
91
<!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 rel="stylesheet" href="style.css">
<link rel="preconnect" href="https://fonts.googleapis.com">
<link rel="preconnect" href="https://fonts.gstatic.com" crossorigin>
<link href="https://fonts.googleapis.com/css2?family=Dancing+Script:wght@600&display=swap" rel="stylesheet">
</head>
<body >
<div id="wizard">
<img id="wiz" src="wizard.png">
</div>
<div class="menu-bar">
<ul>
<li><img src="Amanda Wood.png" alt="" class="logo"></li>
<li><a href="index.html">HOME</a></li>
<li><a href="#">SEARCHING</a>
<div class="sub-menu-search">
<ul>
<li><a href="binarysearch.html">Binary Search</a></li>
<li><a href="linearsearch.html">Linear Search</a></li>
</ul>
</div>
</li>
<li><a href="#">SORTING</a>
<div class="sub-menu-sort">
<ul>
<li><a href="selectionsort.html">Selection Sort</a></li>
<li><a href="insertionsort.html">Insertion Sort</a></li>
<li><a href="bubblesort.html">Bubble Sort</a></li>
<li><a href="heapsort.html">Heap Sort</a></li>
</ul>
</div>
</li>
<li><a href="waiting.html">BACKTRACKING</a></li>
<li><a href="waiting.html">GRAPH TRAVERSAL</a></li>
<li><a href="about.html">ABOUT</a></li>
</ul>
</div>
<div class="main-div">
<h1>
What is an Algorithm?
</h1>
<p class="para">
An algorithm is a procedure used for solving a problem or performing a computation.  Algorithms act as a precise list of instructions that conduct specified actions step by step in either hardware- or software-based routines.  Algorithms are widely used throughout all areas of IT. 
An algorithm works by following a procedure, made up of inputs. Once it has followed all the inputs, it will see a result, also known as output.
<br>
<br>
Characteristics of an algorithm:
</p>
<ol>
<li class="list"><b>Precision</b> – the steps are precisely stated.</li>
<li class="list"><b>Uniqueness</b> – results of each step are uniquely defined and only depend on the input and the result of the preceding steps.</li>
<li class="list"><b>Finiteness</b> – the algorithm stops after a finite number of instructions are executed.</li>
<li class="list"><b>Input </b>– the algorithm receives input.</li>
<li class="list"><b>Output </b>– the algorithm produces output.</li>
<li class="list"><b>Generality </b>– the algorithm applies to a set of inputs.</li>
</ol>
<br>
<br>
<p class="para">
There are seven different types of programming algorithms:
</p>
<ol>
<li class="list">Sort algorithms</li>
<li class="list">Search algorithms</li>
<li class="list">Hashing</li>
<li class="list">Dynamic Programming</li>
<li class="list">Exponential by squaring</li>
<li class="list">String matching and parsing</li>
<li class="list">Primality testing algorithms</li>
</ol>
<br>
</div>
<footer class="foot">
<div>
<p><b>HAPPY LEARNING.  BE   PRODUCTIVE</b></p>
</div>
</footer>
<script src="script.js"></script>
</body>
</html>