/
basics.html
72 lines (67 loc) · 4.21 KB
/
basics.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
<!DOCTYPE html>
<html>
<head>
<title>Hello, Algorithms!</title>
<link rel="stylesheet" type="text/css" href="styles/css/reset.css">
<link rel="stylesheet" type="text/css" href="styles/css/main.css">
<script type="text/javascript" src="app/lib/jquery-1.6.4.min.js"></script>
<script type="text/javascript" src="app/lib/raphael-min.js"></script>
<script type="text/javascript" src="../src/compiled/basics.js"></script>
<script type="text/javascript" src="app/compiled/app.js"></script>
<script type="text/javascript" src="app/compiled/basics_app.js"></script>
</head>
<body>
<div class="demo-container" id="stack">
<h2 class="subject">Stack Demo</h2>
<div id="stack-demo" class="demo part">
<ul class="actions">
<li class="action">
<button class="add">Push</button>
</li>
<li class="action">
<button class="remove">Pop</button>
</li>
</ul>
<div class="stats">
<p class="capacity">Capacity: <span class="number">0</span></p>
<p class="count">Count: <span class="number">0</span></p>
<div class="iteration">
<p class="label">Iteration (top -> bottom):</p>
<p class="all"></p>
</div>
<p class="error"></p>
</div>
</div>
<div class="text part">
<p>"In computer science, a stack is a last in, first out (LIFO) abstract data type and data structure. A stack can have any abstract data type as an element, but is characterized by only three fundamental operations: push, pop and stack top. The push operation adds a new item to the top of the stack, or initializes the stack if it is empty. If the stack is full and does not contain enough space to accept the given item, the stack is then considered to be in an overflow state. The pop operation removes an item from the top of the stack. A pop either reveals previously concealed items, or results in an empty stack, but if the stack is empty then it goes into underflow state (It means no items are present in stack to be removed). The stack top operation gets the data from the top-most position and returns it to the user without deleting it. The same underflow state can also occur in stack top operation if stack is empty."</p>
<a class="source" href="http://en.wikipedia.org/wiki/Stack_(abstract_data_type)">Wikipedia</a>
</div>
</div>
<div class="demo-container" id="queue">
<h2 class="subject">Queue Demo</h2>
<div id="queue-demo" class="demo part">
<ul class="actions">
<li class="action">
<button class="add">Enqueue</button>
</li>
<li class="action">
<button class="remove">Dequeue</button>
</li>
</ul>
<div class="stats">
<p class="capacity">Capacity: <span class="number">0</span></p>
<p class="count">Count: <span class="number">0</span></p>
<div class="iteration">
<p class="label">Iteration (beginning -> end):</p>
<p class="all"></p>
</div>
<p class="error"></p>
</div>
</div>
<div class="text part">
<p>"A queue (pronounced /ˈkjuː/ kew) is a particular kind of collection in which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition of entities to the rear terminal position and removal of entities from the front terminal position. This makes the queue a First-In-First-Out (FIFO) data structure. In a FIFO data structure, the first element added to the queue will be the first one to be removed. This is equivalent to the requirement that once an element is added, all elements that were added before have to be removed before the new element can be invoked. A queue is an example of a linear data structure."</p>
<a class="source" href="http://en.wikipedia.org/wiki/Stack_(abstract_data_type)">Wikipedia</a>
</div>
</div>
</body>
</html>