algorithm_selector 0.1.2 → 0.1.3
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +4 -4
- data/.gitignore +1 -0
- data/.yardoc/checksums +1 -1
- data/.yardoc/objects/root.dat +0 -0
- data/README.md +96 -66
- data/doc/AlgorithmSelector.html +2 -2
- data/doc/BSTNode.html +1 -1
- data/doc/BinaryTree.html +1 -1
- data/doc/LinkNode.html +1 -1
- data/doc/LinkedList.html +1 -1
- data/doc/Queue.html +1 -1
- data/doc/Searches.html +1 -1
- data/doc/Sorts.html +1 -1
- data/doc/Stack.html +1 -1
- data/doc/_index.html +1 -1
- data/doc/file.README.html +115 -47
- data/doc/index.html +115 -47
- data/doc/top-level-namespace.html +1 -1
- data/lib/algorithm_selector/version.rb +1 -1
- metadata +1 -1
checksums.yaml
CHANGED
@@ -1,7 +1,7 @@
|
|
1
1
|
---
|
2
2
|
SHA1:
|
3
|
-
metadata.gz:
|
4
|
-
data.tar.gz:
|
3
|
+
metadata.gz: a376e6c105667d3e1f30aa00c689d6caa209567f
|
4
|
+
data.tar.gz: db8a9e8f776ea09157acd5f5b8159ae0c22db606
|
5
5
|
SHA512:
|
6
|
-
metadata.gz:
|
7
|
-
data.tar.gz:
|
6
|
+
metadata.gz: 5a82bc793441968d2c9e09d6e2b4ac39c5df87dc08a4d84aa067fb06561f33fa9500bce58992c1acc3b32032f0b1d984a51adee0b61fa523947fb3074972fb56
|
7
|
+
data.tar.gz: aa3f80b8936fc8e2eeb0a00a0bf0b4c4567b74d14ac1db937839b6deb4aa5ffb50a4cbeed16a2e4d1d446b15c4aa39fa557114fad7936e83bb2c6250eaed328c
|
data/.gitignore
CHANGED
data/.yardoc/checksums
CHANGED
@@ -1,2 +1,2 @@
|
|
1
1
|
lib/algorithm_selector.rb 300cdf69ec09250719da398de917f15df18d8761
|
2
|
-
lib/algorithm_selector/version.rb
|
2
|
+
lib/algorithm_selector/version.rb 7003767023eb9510f1fdeffc9ebaec0b15cbb3a9
|
data/.yardoc/objects/root.dat
CHANGED
Binary file
|
data/README.md
CHANGED
@@ -36,13 +36,16 @@ Written by Joseph Bui.
|
|
36
36
|
* `all(action, data_set, trials, target)`
|
37
37
|
* Returns the times for each algorithm
|
38
38
|
* Example:
|
39
|
+
|
39
40
|
```ruby
|
40
41
|
AlgorithmSelector.all("sort", [2,1,4,3], 1000)
|
41
42
|
AlgorithmSelector.all("search", [2,1,4,3], 1000, 4)
|
42
43
|
```
|
44
|
+
|
43
45
|
* `best(action, data_set, trials, target)`
|
44
46
|
* Returns the algorithm with the best time
|
45
47
|
* Example:
|
48
|
+
|
46
49
|
```ruby
|
47
50
|
AlgorithmSelector.best("sort", [2,1,4,3], 1000)
|
48
51
|
AlgorithmSelector.best("search", [2,1,4,3], 1000, 4)
|
@@ -51,6 +54,7 @@ AlgorithmSelector.best("search", [2,1,4,3], 1000, 4)
|
|
51
54
|
* `analyze(action, data_set, algorithm, trials, target)`
|
52
55
|
* Returns time for specified algorithm or data structure
|
53
56
|
* Example:
|
57
|
+
|
54
58
|
```ruby
|
55
59
|
AlgorithmSelector.analyze("sort", [2,1,4,3], "merge_sort", 1000)
|
56
60
|
AlgorithmSelector.analyze("search", [2,1,4,3], "linked_list", 1000, 4)
|
@@ -59,6 +63,7 @@ AlgorithmSelector.analyze("search", [2,1,4,3], "linked_list", 1000, 4)
|
|
59
63
|
* `compare(action, data_set, first_algorithm, second_algorithm, trials, target)`
|
60
64
|
* Returns the times of two specified algorithms for comparison
|
61
65
|
* Example:
|
66
|
+
|
62
67
|
```ruby
|
63
68
|
AlgorithmSelector.compare("sort", [2,1,4,3], "merge_sort", "quick_sort", 1000)
|
64
69
|
AlgorithmSelector.compare("search", [2,1,4,3], "stack", "linked_list", 1000, 4)
|
@@ -67,6 +72,7 @@ AlgorithmSelector.compare("search", [2,1,4,3], "stack", "linked_list", 1000, 4)
|
|
67
72
|
* `sort(data_set, algorithm)`
|
68
73
|
* Returns sorted array of specified sorting algorithm
|
69
74
|
* Example:
|
75
|
+
|
70
76
|
```ruby
|
71
77
|
AlgorithmSelector.compare([2,1,4,3], "bubble_sort")
|
72
78
|
```
|
@@ -74,78 +80,102 @@ AlgorithmSelector.compare([2,1,4,3], "bubble_sort")
|
|
74
80
|
### Data Structures
|
75
81
|
|
76
82
|
#### Stack
|
77
|
-
|
78
|
-
|
79
|
-
|
80
|
-
|
81
|
-
|
82
|
-
|
83
|
-
|
84
|
-
|
85
|
-
|
86
|
-
|
87
|
-
|
88
|
-
|
89
|
-
|
90
|
-
|
91
|
-
|
92
|
-
|
93
|
-
|
83
|
+
|
84
|
+
* Initialize
|
85
|
+
|
86
|
+
```ruby
|
87
|
+
size = 10
|
88
|
+
stack = Stack.new(size)
|
89
|
+
```
|
90
|
+
|
91
|
+
* Insertion
|
92
|
+
|
93
|
+
```ruby
|
94
|
+
# returns nil
|
95
|
+
value = 6
|
96
|
+
stack.push(value)
|
97
|
+
```
|
98
|
+
|
99
|
+
* Search
|
100
|
+
|
101
|
+
```ruby
|
102
|
+
# returns true if found, else returns false
|
103
|
+
target = 4
|
104
|
+
stack.search(target)
|
105
|
+
```
|
94
106
|
|
95
107
|
#### Queue
|
96
|
-
|
97
|
-
|
98
|
-
|
99
|
-
|
100
|
-
|
101
|
-
|
102
|
-
|
103
|
-
|
104
|
-
|
105
|
-
|
106
|
-
|
107
|
-
|
108
|
-
|
109
|
-
|
110
|
-
|
111
|
-
|
112
|
-
|
108
|
+
|
109
|
+
* Initialize
|
110
|
+
|
111
|
+
```ruby
|
112
|
+
size = 10
|
113
|
+
queue = Queue.new(size)
|
114
|
+
```
|
115
|
+
|
116
|
+
* Insertion
|
117
|
+
|
118
|
+
```ruby
|
119
|
+
# returns nil
|
120
|
+
value = 6
|
121
|
+
queue.enqueue(value)
|
122
|
+
```
|
123
|
+
|
124
|
+
* Search
|
125
|
+
|
126
|
+
```ruby
|
127
|
+
# returns true if found, else returns false
|
128
|
+
target = 4
|
129
|
+
queue.search(target)
|
130
|
+
```
|
113
131
|
|
114
132
|
#### Linked List
|
115
|
-
|
116
|
-
|
117
|
-
|
118
|
-
|
119
|
-
|
120
|
-
|
121
|
-
|
122
|
-
|
123
|
-
|
124
|
-
|
125
|
-
|
126
|
-
|
127
|
-
|
128
|
-
|
129
|
-
|
130
|
-
|
133
|
+
|
134
|
+
* Initialize
|
135
|
+
|
136
|
+
```ruby
|
137
|
+
linked_list = LinkedList.new
|
138
|
+
```
|
139
|
+
|
140
|
+
* Insertion
|
141
|
+
|
142
|
+
```ruby
|
143
|
+
# returns nil
|
144
|
+
value = 6
|
145
|
+
linked_list.insert(value)
|
146
|
+
```
|
147
|
+
|
148
|
+
* Search
|
149
|
+
|
150
|
+
```ruby
|
151
|
+
# returns true if found, else returns false
|
152
|
+
target = 4
|
153
|
+
linked_list.search(target)
|
154
|
+
```
|
131
155
|
|
132
156
|
#### Binary Search Tree
|
133
|
-
|
134
|
-
|
135
|
-
|
136
|
-
|
137
|
-
|
138
|
-
|
139
|
-
|
140
|
-
|
141
|
-
|
142
|
-
|
143
|
-
|
144
|
-
|
145
|
-
|
146
|
-
|
147
|
-
|
148
|
-
|
157
|
+
|
158
|
+
* Initialize
|
159
|
+
|
160
|
+
```ruby
|
161
|
+
binary_tree = BinaryTree.new
|
162
|
+
```
|
163
|
+
|
164
|
+
* Insertion
|
165
|
+
|
166
|
+
```ruby
|
167
|
+
# returns nil
|
168
|
+
value = 6
|
169
|
+
binary_tree.insert(value)
|
170
|
+
```
|
171
|
+
|
172
|
+
* Search
|
173
|
+
|
174
|
+
```ruby
|
175
|
+
# returns true if found, else returns false
|
176
|
+
target = 4
|
177
|
+
binary_tree.search(target)
|
178
|
+
```
|
149
179
|
|
150
180
|
## Installation
|
151
181
|
|
data/doc/AlgorithmSelector.html
CHANGED
@@ -115,7 +115,7 @@
|
|
115
115
|
<dt id="VERSION-constant" class="">VERSION =
|
116
116
|
|
117
117
|
</dt>
|
118
|
-
<dd><pre class="code"><span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>0.1.
|
118
|
+
<dd><pre class="code"><span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>0.1.2</span><span class='tstring_end'>"</span></span></pre></dd>
|
119
119
|
|
120
120
|
</dl>
|
121
121
|
|
@@ -506,7 +506,7 @@
|
|
506
506
|
</div>
|
507
507
|
|
508
508
|
<div id="footer">
|
509
|
-
Generated on Sat Jul 23 23:
|
509
|
+
Generated on Sat Jul 23 23:45:47 2016 by
|
510
510
|
<a href="http://yardoc.org" title="Yay! A Ruby Documentation Tool" target="_parent">yard</a>
|
511
511
|
0.9.4 (ruby-2.1.2).
|
512
512
|
</div>
|
data/doc/BSTNode.html
CHANGED
@@ -430,7 +430,7 @@
|
|
430
430
|
</div>
|
431
431
|
|
432
432
|
<div id="footer">
|
433
|
-
Generated on Sat Jul 23 23:
|
433
|
+
Generated on Sat Jul 23 23:45:48 2016 by
|
434
434
|
<a href="http://yardoc.org" title="Yay! A Ruby Documentation Tool" target="_parent">yard</a>
|
435
435
|
0.9.4 (ruby-2.1.2).
|
436
436
|
</div>
|
data/doc/BinaryTree.html
CHANGED
@@ -562,7 +562,7 @@
|
|
562
562
|
</div>
|
563
563
|
|
564
564
|
<div id="footer">
|
565
|
-
Generated on Sat Jul 23 23:
|
565
|
+
Generated on Sat Jul 23 23:45:48 2016 by
|
566
566
|
<a href="http://yardoc.org" title="Yay! A Ruby Documentation Tool" target="_parent">yard</a>
|
567
567
|
0.9.4 (ruby-2.1.2).
|
568
568
|
</div>
|
data/doc/LinkNode.html
CHANGED
@@ -430,7 +430,7 @@
|
|
430
430
|
</div>
|
431
431
|
|
432
432
|
<div id="footer">
|
433
|
-
Generated on Sat Jul 23 23:
|
433
|
+
Generated on Sat Jul 23 23:45:48 2016 by
|
434
434
|
<a href="http://yardoc.org" title="Yay! A Ruby Documentation Tool" target="_parent">yard</a>
|
435
435
|
0.9.4 (ruby-2.1.2).
|
436
436
|
</div>
|
data/doc/LinkedList.html
CHANGED
@@ -869,7 +869,7 @@
|
|
869
869
|
</div>
|
870
870
|
|
871
871
|
<div id="footer">
|
872
|
-
Generated on Sat Jul 23 23:
|
872
|
+
Generated on Sat Jul 23 23:45:48 2016 by
|
873
873
|
<a href="http://yardoc.org" title="Yay! A Ruby Documentation Tool" target="_parent">yard</a>
|
874
874
|
0.9.4 (ruby-2.1.2).
|
875
875
|
</div>
|
data/doc/Queue.html
CHANGED
@@ -546,7 +546,7 @@
|
|
546
546
|
</div>
|
547
547
|
|
548
548
|
<div id="footer">
|
549
|
-
Generated on Sat Jul 23 23:
|
549
|
+
Generated on Sat Jul 23 23:45:48 2016 by
|
550
550
|
<a href="http://yardoc.org" title="Yay! A Ruby Documentation Tool" target="_parent">yard</a>
|
551
551
|
0.9.4 (ruby-2.1.2).
|
552
552
|
</div>
|
data/doc/Searches.html
CHANGED
@@ -495,7 +495,7 @@
|
|
495
495
|
</div>
|
496
496
|
|
497
497
|
<div id="footer">
|
498
|
-
Generated on Sat Jul 23 23:
|
498
|
+
Generated on Sat Jul 23 23:45:48 2016 by
|
499
499
|
<a href="http://yardoc.org" title="Yay! A Ruby Documentation Tool" target="_parent">yard</a>
|
500
500
|
0.9.4 (ruby-2.1.2).
|
501
501
|
</div>
|
data/doc/Sorts.html
CHANGED
@@ -907,7 +907,7 @@ Complexity: O(n^2) Worst-Case Time Complexity: O(n^2)</p>
|
|
907
907
|
</div>
|
908
908
|
|
909
909
|
<div id="footer">
|
910
|
-
Generated on Sat Jul 23 23:
|
910
|
+
Generated on Sat Jul 23 23:45:48 2016 by
|
911
911
|
<a href="http://yardoc.org" title="Yay! A Ruby Documentation Tool" target="_parent">yard</a>
|
912
912
|
0.9.4 (ruby-2.1.2).
|
913
913
|
</div>
|
data/doc/Stack.html
CHANGED
@@ -700,7 +700,7 @@ Complexity: O(n)</p>
|
|
700
700
|
</div>
|
701
701
|
|
702
702
|
<div id="footer">
|
703
|
-
Generated on Sat Jul 23 23:
|
703
|
+
Generated on Sat Jul 23 23:45:48 2016 by
|
704
704
|
<a href="http://yardoc.org" title="Yay! A Ruby Documentation Tool" target="_parent">yard</a>
|
705
705
|
0.9.4 (ruby-2.1.2).
|
706
706
|
</div>
|
data/doc/_index.html
CHANGED
@@ -173,7 +173,7 @@
|
|
173
173
|
</div>
|
174
174
|
|
175
175
|
<div id="footer">
|
176
|
-
Generated on Sat Jul 23 23:
|
176
|
+
Generated on Sat Jul 23 23:45:47 2016 by
|
177
177
|
<a href="http://yardoc.org" title="Yay! A Ruby Documentation Tool" target="_parent">yard</a>
|
178
178
|
0.9.4 (ruby-2.1.2).
|
179
179
|
</div>
|
data/doc/file.README.html
CHANGED
@@ -124,89 +124,157 @@ future.</p>
|
|
124
124
|
</li><li>
|
125
125
|
<p>Returns the times for each algorithm</p>
|
126
126
|
</li><li>
|
127
|
-
<p>Example
|
128
|
-
|
129
|
-
|
127
|
+
<p>Example:</p>
|
128
|
+
</li></ul>
|
129
|
+
|
130
|
+
<pre class="code ruby"><code class="ruby"><span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_all'>all</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>sort</span><span class='tstring_end'>"</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='int'>1000</span><span class='rparen'>)</span>
|
131
|
+
<span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_all'>all</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>search</span><span class='tstring_end'>"</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='int'>1000</span><span class='comma'>,</span> <span class='int'>4</span><span class='rparen'>)</span>
|
132
|
+
</code></pre>
|
133
|
+
<ul><li>
|
130
134
|
<p><code>best(action, data_set, trials, target)</code></p>
|
131
135
|
</li><li>
|
132
136
|
<p>Returns the algorithm with the best time</p>
|
133
137
|
</li><li>
|
134
|
-
<p>Example
|
135
|
-
|
136
|
-
|
137
|
-
</
|
138
|
+
<p>Example:</p>
|
139
|
+
</li></ul>
|
140
|
+
|
141
|
+
<pre class="code ruby"><code class="ruby"><span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_best'>best</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>sort</span><span class='tstring_end'>"</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='int'>1000</span><span class='rparen'>)</span>
|
142
|
+
<span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_best'>best</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>search</span><span class='tstring_end'>"</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='int'>1000</span><span class='comma'>,</span> <span class='int'>4</span><span class='rparen'>)</span>
|
143
|
+
</code></pre>
|
144
|
+
<ul><li>
|
138
145
|
<p><code>analyze(action, data_set, algorithm, trials, target)</code></p>
|
139
146
|
</li><li>
|
140
147
|
<p>Returns time for specified algorithm or data structure</p>
|
141
148
|
</li><li>
|
142
|
-
<p>Example
|
143
|
-
|
144
|
-
|
145
|
-
</
|
149
|
+
<p>Example:</p>
|
150
|
+
</li></ul>
|
151
|
+
|
152
|
+
<pre class="code ruby"><code class="ruby"><span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_analyze'>analyze</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>sort</span><span class='tstring_end'>"</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>merge_sort</span><span class='tstring_end'>"</span></span><span class='comma'>,</span> <span class='int'>1000</span><span class='rparen'>)</span>
|
153
|
+
<span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_analyze'>analyze</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>search</span><span class='tstring_end'>"</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>linked_list</span><span class='tstring_end'>"</span></span><span class='comma'>,</span> <span class='int'>1000</span><span class='comma'>,</span> <span class='int'>4</span><span class='rparen'>)</span>
|
154
|
+
</code></pre>
|
155
|
+
<ul><li>
|
146
156
|
<p><code>compare(action, data_set, first_algorithm, second_algorithm, trials,
|
147
157
|
target)</code></p>
|
148
158
|
</li><li>
|
149
159
|
<p>Returns the times of two specified algorithms for comparison</p>
|
150
160
|
</li><li>
|
151
|
-
<p>Example
|
152
|
-
|
153
|
-
|
154
|
-
|
155
|
-
</
|
161
|
+
<p>Example:</p>
|
162
|
+
</li></ul>
|
163
|
+
|
164
|
+
<pre class="code ruby"><code class="ruby"><span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_compare'>compare</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>sort</span><span class='tstring_end'>"</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>merge_sort</span><span class='tstring_end'>"</span></span><span class='comma'>,</span> <span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>quick_sort</span><span class='tstring_end'>"</span></span><span class='comma'>,</span> <span class='int'>1000</span><span class='rparen'>)</span>
|
165
|
+
<span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_compare'>compare</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>search</span><span class='tstring_end'>"</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>stack</span><span class='tstring_end'>"</span></span><span class='comma'>,</span> <span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>linked_list</span><span class='tstring_end'>"</span></span><span class='comma'>,</span> <span class='int'>1000</span><span class='comma'>,</span> <span class='int'>4</span><span class='rparen'>)</span>
|
166
|
+
</code></pre>
|
167
|
+
<ul><li>
|
156
168
|
<p><code>sort(data_set, algorithm)</code></p>
|
157
169
|
</li><li>
|
158
170
|
<p>Returns sorted array of specified sorting algorithm</p>
|
159
171
|
</li><li>
|
160
|
-
<p>Example
|
161
|
-
"bubble_sort") </code></p>
|
172
|
+
<p>Example:</p>
|
162
173
|
</li></ul>
|
163
174
|
|
175
|
+
<pre class="code ruby"><code class="ruby"><span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_compare'>compare</span><span class='lparen'>(</span><span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>bubble_sort</span><span class='tstring_end'>"</span></span><span class='rparen'>)</span>
|
176
|
+
</code></pre>
|
177
|
+
|
164
178
|
<h3 id="label-Data+Structures">Data Structures</h3>
|
165
179
|
|
166
180
|
<h4 id="label-Stack">Stack</h4>
|
167
181
|
<ul><li>
|
168
|
-
<p>Initialize
|
169
|
-
</li><li>
|
170
|
-
<p>Insertion <code>ruby # returns nil value = 6 stack.push(value)
|
171
|
-
</code></p>
|
172
|
-
</li><li>
|
173
|
-
<p>Search <code>ruby # returns true if found, else returns false target =
|
174
|
-
4 stack.search(target) </code></p>
|
182
|
+
<p>Initialize</p>
|
175
183
|
</li></ul>
|
176
184
|
|
185
|
+
<pre class="code ruby"><code class="ruby"><span class='id identifier rubyid_size'>size</span> <span class='op'>=</span> <span class='int'>10</span>
|
186
|
+
<span class='id identifier rubyid_stack'>stack</span> <span class='op'>=</span> <span class='const'>Stack</span><span class='period'>.</span><span class='id identifier rubyid_new'>new</span><span class='lparen'>(</span><span class='id identifier rubyid_size'>size</span><span class='rparen'>)</span>
|
187
|
+
</code></pre>
|
188
|
+
<ul><li>
|
189
|
+
<p>Insertion</p>
|
190
|
+
</li></ul>
|
191
|
+
|
192
|
+
<pre class="code ruby"><code class="ruby"><span class='comment'># returns nil
|
193
|
+
</span><span class='id identifier rubyid_value'>value</span> <span class='op'>=</span> <span class='int'>6</span>
|
194
|
+
<span class='id identifier rubyid_stack'>stack</span><span class='period'>.</span><span class='id identifier rubyid_push'>push</span><span class='lparen'>(</span><span class='id identifier rubyid_value'>value</span><span class='rparen'>)</span>
|
195
|
+
</code></pre>
|
196
|
+
<ul><li>
|
197
|
+
<p>Search</p>
|
198
|
+
</li></ul>
|
199
|
+
|
200
|
+
<pre class="code ruby"><code class="ruby"><span class='comment'># returns true if found, else returns false
|
201
|
+
</span><span class='id identifier rubyid_target'>target</span> <span class='op'>=</span> <span class='int'>4</span>
|
202
|
+
<span class='id identifier rubyid_stack'>stack</span><span class='period'>.</span><span class='id identifier rubyid_search'>search</span><span class='lparen'>(</span><span class='id identifier rubyid_target'>target</span><span class='rparen'>)</span>
|
203
|
+
</code></pre>
|
204
|
+
|
177
205
|
<h4 id="label-Queue">Queue</h4>
|
178
206
|
<ul><li>
|
179
|
-
<p>Initialize
|
180
|
-
</li
|
181
|
-
|
182
|
-
|
183
|
-
</
|
184
|
-
|
185
|
-
|
207
|
+
<p>Initialize</p>
|
208
|
+
</li></ul>
|
209
|
+
|
210
|
+
<pre class="code ruby"><code class="ruby"><span class='id identifier rubyid_size'>size</span> <span class='op'>=</span> <span class='int'>10</span>
|
211
|
+
<span class='id identifier rubyid_queue'>queue</span> <span class='op'>=</span> <span class='const'>Queue</span><span class='period'>.</span><span class='id identifier rubyid_new'>new</span><span class='lparen'>(</span><span class='id identifier rubyid_size'>size</span><span class='rparen'>)</span>
|
212
|
+
</code></pre>
|
213
|
+
<ul><li>
|
214
|
+
<p>Insertion</p>
|
215
|
+
</li></ul>
|
216
|
+
|
217
|
+
<pre class="code ruby"><code class="ruby"><span class='comment'># returns nil
|
218
|
+
</span><span class='id identifier rubyid_value'>value</span> <span class='op'>=</span> <span class='int'>6</span>
|
219
|
+
<span class='id identifier rubyid_queue'>queue</span><span class='period'>.</span><span class='id identifier rubyid_enqueue'>enqueue</span><span class='lparen'>(</span><span class='id identifier rubyid_value'>value</span><span class='rparen'>)</span>
|
220
|
+
</code></pre>
|
221
|
+
<ul><li>
|
222
|
+
<p>Search</p>
|
186
223
|
</li></ul>
|
187
224
|
|
225
|
+
<pre class="code ruby"><code class="ruby"><span class='comment'># returns true if found, else returns false
|
226
|
+
</span><span class='id identifier rubyid_target'>target</span> <span class='op'>=</span> <span class='int'>4</span>
|
227
|
+
<span class='id identifier rubyid_queue'>queue</span><span class='period'>.</span><span class='id identifier rubyid_search'>search</span><span class='lparen'>(</span><span class='id identifier rubyid_target'>target</span><span class='rparen'>)</span>
|
228
|
+
</code></pre>
|
229
|
+
|
188
230
|
<h4 id="label-Linked+List">Linked List</h4>
|
189
231
|
<ul><li>
|
190
|
-
<p>Initialize
|
191
|
-
</li><li>
|
192
|
-
<p>Insertion <code>ruby # returns nil value = 6
|
193
|
-
linked_list.insert(value) </code></p>
|
194
|
-
</li><li>
|
195
|
-
<p>Search <code>ruby # returns true if found, else returns false target =
|
196
|
-
4 linked_list.search(target) </code></p>
|
232
|
+
<p>Initialize</p>
|
197
233
|
</li></ul>
|
198
234
|
|
235
|
+
<pre class="code ruby"><code class="ruby"><span class='id identifier rubyid_linked_list'>linked_list</span> <span class='op'>=</span> <span class='const'>LinkedList</span><span class='period'>.</span><span class='id identifier rubyid_new'>new</span>
|
236
|
+
</code></pre>
|
237
|
+
<ul><li>
|
238
|
+
<p>Insertion</p>
|
239
|
+
</li></ul>
|
240
|
+
|
241
|
+
<pre class="code ruby"><code class="ruby"><span class='comment'># returns nil
|
242
|
+
</span><span class='id identifier rubyid_value'>value</span> <span class='op'>=</span> <span class='int'>6</span>
|
243
|
+
<span class='id identifier rubyid_linked_list'>linked_list</span><span class='period'>.</span><span class='id identifier rubyid_insert'>insert</span><span class='lparen'>(</span><span class='id identifier rubyid_value'>value</span><span class='rparen'>)</span>
|
244
|
+
</code></pre>
|
245
|
+
<ul><li>
|
246
|
+
<p>Search</p>
|
247
|
+
</li></ul>
|
248
|
+
|
249
|
+
<pre class="code ruby"><code class="ruby"><span class='comment'># returns true if found, else returns false
|
250
|
+
</span><span class='id identifier rubyid_target'>target</span> <span class='op'>=</span> <span class='int'>4</span>
|
251
|
+
<span class='id identifier rubyid_linked_list'>linked_list</span><span class='period'>.</span><span class='id identifier rubyid_search'>search</span><span class='lparen'>(</span><span class='id identifier rubyid_target'>target</span><span class='rparen'>)</span>
|
252
|
+
</code></pre>
|
253
|
+
|
199
254
|
<h4 id="label-Binary+Search+Tree">Binary Search Tree</h4>
|
200
255
|
<ul><li>
|
201
|
-
<p>Initialize
|
202
|
-
</li><li>
|
203
|
-
<p>Insertion <code>ruby # returns nil value = 6
|
204
|
-
binary_tree.insert(value) </code></p>
|
205
|
-
</li><li>
|
206
|
-
<p>Search <code>ruby # returns true if found, else returns false target =
|
207
|
-
4 binary_tree.search(target) </code></p>
|
256
|
+
<p>Initialize</p>
|
208
257
|
</li></ul>
|
209
258
|
|
259
|
+
<pre class="code ruby"><code class="ruby"><span class='id identifier rubyid_binary_tree'>binary_tree</span> <span class='op'>=</span> <span class='const'>BinaryTree</span><span class='period'>.</span><span class='id identifier rubyid_new'>new</span>
|
260
|
+
</code></pre>
|
261
|
+
<ul><li>
|
262
|
+
<p>Insertion</p>
|
263
|
+
</li></ul>
|
264
|
+
|
265
|
+
<pre class="code ruby"><code class="ruby"><span class='comment'># returns nil
|
266
|
+
</span><span class='id identifier rubyid_value'>value</span> <span class='op'>=</span> <span class='int'>6</span>
|
267
|
+
<span class='id identifier rubyid_binary_tree'>binary_tree</span><span class='period'>.</span><span class='id identifier rubyid_insert'>insert</span><span class='lparen'>(</span><span class='id identifier rubyid_value'>value</span><span class='rparen'>)</span>
|
268
|
+
</code></pre>
|
269
|
+
<ul><li>
|
270
|
+
<p>Search</p>
|
271
|
+
</li></ul>
|
272
|
+
|
273
|
+
<pre class="code ruby"><code class="ruby"><span class='comment'># returns true if found, else returns false
|
274
|
+
</span><span class='id identifier rubyid_target'>target</span> <span class='op'>=</span> <span class='int'>4</span>
|
275
|
+
<span class='id identifier rubyid_binary_tree'>binary_tree</span><span class='period'>.</span><span class='id identifier rubyid_search'>search</span><span class='lparen'>(</span><span class='id identifier rubyid_target'>target</span><span class='rparen'>)</span>
|
276
|
+
</code></pre>
|
277
|
+
|
210
278
|
<h2 id="label-Installation">Installation</h2>
|
211
279
|
|
212
280
|
<p>Add this line to your application's Gemfile:</p>
|
@@ -244,7 +312,7 @@ href="http://opensource.org/licenses/MIT">MIT License</a>.</p>
|
|
244
312
|
</div></div>
|
245
313
|
|
246
314
|
<div id="footer">
|
247
|
-
Generated on Sat Jul 23 23:
|
315
|
+
Generated on Sat Jul 23 23:45:47 2016 by
|
248
316
|
<a href="http://yardoc.org" title="Yay! A Ruby Documentation Tool" target="_parent">yard</a>
|
249
317
|
0.9.4 (ruby-2.1.2).
|
250
318
|
</div>
|
data/doc/index.html
CHANGED
@@ -124,89 +124,157 @@ future.</p>
|
|
124
124
|
</li><li>
|
125
125
|
<p>Returns the times for each algorithm</p>
|
126
126
|
</li><li>
|
127
|
-
<p>Example
|
128
|
-
|
129
|
-
|
127
|
+
<p>Example:</p>
|
128
|
+
</li></ul>
|
129
|
+
|
130
|
+
<pre class="code ruby"><code class="ruby"><span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_all'>all</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>sort</span><span class='tstring_end'>"</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='int'>1000</span><span class='rparen'>)</span>
|
131
|
+
<span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_all'>all</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>search</span><span class='tstring_end'>"</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='int'>1000</span><span class='comma'>,</span> <span class='int'>4</span><span class='rparen'>)</span>
|
132
|
+
</code></pre>
|
133
|
+
<ul><li>
|
130
134
|
<p><code>best(action, data_set, trials, target)</code></p>
|
131
135
|
</li><li>
|
132
136
|
<p>Returns the algorithm with the best time</p>
|
133
137
|
</li><li>
|
134
|
-
<p>Example
|
135
|
-
|
136
|
-
|
137
|
-
</
|
138
|
+
<p>Example:</p>
|
139
|
+
</li></ul>
|
140
|
+
|
141
|
+
<pre class="code ruby"><code class="ruby"><span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_best'>best</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>sort</span><span class='tstring_end'>"</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='int'>1000</span><span class='rparen'>)</span>
|
142
|
+
<span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_best'>best</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>search</span><span class='tstring_end'>"</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='int'>1000</span><span class='comma'>,</span> <span class='int'>4</span><span class='rparen'>)</span>
|
143
|
+
</code></pre>
|
144
|
+
<ul><li>
|
138
145
|
<p><code>analyze(action, data_set, algorithm, trials, target)</code></p>
|
139
146
|
</li><li>
|
140
147
|
<p>Returns time for specified algorithm or data structure</p>
|
141
148
|
</li><li>
|
142
|
-
<p>Example
|
143
|
-
|
144
|
-
|
145
|
-
</
|
149
|
+
<p>Example:</p>
|
150
|
+
</li></ul>
|
151
|
+
|
152
|
+
<pre class="code ruby"><code class="ruby"><span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_analyze'>analyze</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>sort</span><span class='tstring_end'>"</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>merge_sort</span><span class='tstring_end'>"</span></span><span class='comma'>,</span> <span class='int'>1000</span><span class='rparen'>)</span>
|
153
|
+
<span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_analyze'>analyze</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>search</span><span class='tstring_end'>"</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>linked_list</span><span class='tstring_end'>"</span></span><span class='comma'>,</span> <span class='int'>1000</span><span class='comma'>,</span> <span class='int'>4</span><span class='rparen'>)</span>
|
154
|
+
</code></pre>
|
155
|
+
<ul><li>
|
146
156
|
<p><code>compare(action, data_set, first_algorithm, second_algorithm, trials,
|
147
157
|
target)</code></p>
|
148
158
|
</li><li>
|
149
159
|
<p>Returns the times of two specified algorithms for comparison</p>
|
150
160
|
</li><li>
|
151
|
-
<p>Example
|
152
|
-
|
153
|
-
|
154
|
-
|
155
|
-
</
|
161
|
+
<p>Example:</p>
|
162
|
+
</li></ul>
|
163
|
+
|
164
|
+
<pre class="code ruby"><code class="ruby"><span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_compare'>compare</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>sort</span><span class='tstring_end'>"</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>merge_sort</span><span class='tstring_end'>"</span></span><span class='comma'>,</span> <span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>quick_sort</span><span class='tstring_end'>"</span></span><span class='comma'>,</span> <span class='int'>1000</span><span class='rparen'>)</span>
|
165
|
+
<span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_compare'>compare</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>search</span><span class='tstring_end'>"</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>stack</span><span class='tstring_end'>"</span></span><span class='comma'>,</span> <span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>linked_list</span><span class='tstring_end'>"</span></span><span class='comma'>,</span> <span class='int'>1000</span><span class='comma'>,</span> <span class='int'>4</span><span class='rparen'>)</span>
|
166
|
+
</code></pre>
|
167
|
+
<ul><li>
|
156
168
|
<p><code>sort(data_set, algorithm)</code></p>
|
157
169
|
</li><li>
|
158
170
|
<p>Returns sorted array of specified sorting algorithm</p>
|
159
171
|
</li><li>
|
160
|
-
<p>Example
|
161
|
-
"bubble_sort") </code></p>
|
172
|
+
<p>Example:</p>
|
162
173
|
</li></ul>
|
163
174
|
|
175
|
+
<pre class="code ruby"><code class="ruby"><span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_compare'>compare</span><span class='lparen'>(</span><span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='tstring'><span class='tstring_beg'>"</span><span class='tstring_content'>bubble_sort</span><span class='tstring_end'>"</span></span><span class='rparen'>)</span>
|
176
|
+
</code></pre>
|
177
|
+
|
164
178
|
<h3 id="label-Data+Structures">Data Structures</h3>
|
165
179
|
|
166
180
|
<h4 id="label-Stack">Stack</h4>
|
167
181
|
<ul><li>
|
168
|
-
<p>Initialize
|
169
|
-
</li><li>
|
170
|
-
<p>Insertion <code>ruby # returns nil value = 6 stack.push(value)
|
171
|
-
</code></p>
|
172
|
-
</li><li>
|
173
|
-
<p>Search <code>ruby # returns true if found, else returns false target =
|
174
|
-
4 stack.search(target) </code></p>
|
182
|
+
<p>Initialize</p>
|
175
183
|
</li></ul>
|
176
184
|
|
185
|
+
<pre class="code ruby"><code class="ruby"><span class='id identifier rubyid_size'>size</span> <span class='op'>=</span> <span class='int'>10</span>
|
186
|
+
<span class='id identifier rubyid_stack'>stack</span> <span class='op'>=</span> <span class='const'>Stack</span><span class='period'>.</span><span class='id identifier rubyid_new'>new</span><span class='lparen'>(</span><span class='id identifier rubyid_size'>size</span><span class='rparen'>)</span>
|
187
|
+
</code></pre>
|
188
|
+
<ul><li>
|
189
|
+
<p>Insertion</p>
|
190
|
+
</li></ul>
|
191
|
+
|
192
|
+
<pre class="code ruby"><code class="ruby"><span class='comment'># returns nil
|
193
|
+
</span><span class='id identifier rubyid_value'>value</span> <span class='op'>=</span> <span class='int'>6</span>
|
194
|
+
<span class='id identifier rubyid_stack'>stack</span><span class='period'>.</span><span class='id identifier rubyid_push'>push</span><span class='lparen'>(</span><span class='id identifier rubyid_value'>value</span><span class='rparen'>)</span>
|
195
|
+
</code></pre>
|
196
|
+
<ul><li>
|
197
|
+
<p>Search</p>
|
198
|
+
</li></ul>
|
199
|
+
|
200
|
+
<pre class="code ruby"><code class="ruby"><span class='comment'># returns true if found, else returns false
|
201
|
+
</span><span class='id identifier rubyid_target'>target</span> <span class='op'>=</span> <span class='int'>4</span>
|
202
|
+
<span class='id identifier rubyid_stack'>stack</span><span class='period'>.</span><span class='id identifier rubyid_search'>search</span><span class='lparen'>(</span><span class='id identifier rubyid_target'>target</span><span class='rparen'>)</span>
|
203
|
+
</code></pre>
|
204
|
+
|
177
205
|
<h4 id="label-Queue">Queue</h4>
|
178
206
|
<ul><li>
|
179
|
-
<p>Initialize
|
180
|
-
</li
|
181
|
-
|
182
|
-
|
183
|
-
</
|
184
|
-
|
185
|
-
|
207
|
+
<p>Initialize</p>
|
208
|
+
</li></ul>
|
209
|
+
|
210
|
+
<pre class="code ruby"><code class="ruby"><span class='id identifier rubyid_size'>size</span> <span class='op'>=</span> <span class='int'>10</span>
|
211
|
+
<span class='id identifier rubyid_queue'>queue</span> <span class='op'>=</span> <span class='const'>Queue</span><span class='period'>.</span><span class='id identifier rubyid_new'>new</span><span class='lparen'>(</span><span class='id identifier rubyid_size'>size</span><span class='rparen'>)</span>
|
212
|
+
</code></pre>
|
213
|
+
<ul><li>
|
214
|
+
<p>Insertion</p>
|
215
|
+
</li></ul>
|
216
|
+
|
217
|
+
<pre class="code ruby"><code class="ruby"><span class='comment'># returns nil
|
218
|
+
</span><span class='id identifier rubyid_value'>value</span> <span class='op'>=</span> <span class='int'>6</span>
|
219
|
+
<span class='id identifier rubyid_queue'>queue</span><span class='period'>.</span><span class='id identifier rubyid_enqueue'>enqueue</span><span class='lparen'>(</span><span class='id identifier rubyid_value'>value</span><span class='rparen'>)</span>
|
220
|
+
</code></pre>
|
221
|
+
<ul><li>
|
222
|
+
<p>Search</p>
|
186
223
|
</li></ul>
|
187
224
|
|
225
|
+
<pre class="code ruby"><code class="ruby"><span class='comment'># returns true if found, else returns false
|
226
|
+
</span><span class='id identifier rubyid_target'>target</span> <span class='op'>=</span> <span class='int'>4</span>
|
227
|
+
<span class='id identifier rubyid_queue'>queue</span><span class='period'>.</span><span class='id identifier rubyid_search'>search</span><span class='lparen'>(</span><span class='id identifier rubyid_target'>target</span><span class='rparen'>)</span>
|
228
|
+
</code></pre>
|
229
|
+
|
188
230
|
<h4 id="label-Linked+List">Linked List</h4>
|
189
231
|
<ul><li>
|
190
|
-
<p>Initialize
|
191
|
-
</li><li>
|
192
|
-
<p>Insertion <code>ruby # returns nil value = 6
|
193
|
-
linked_list.insert(value) </code></p>
|
194
|
-
</li><li>
|
195
|
-
<p>Search <code>ruby # returns true if found, else returns false target =
|
196
|
-
4 linked_list.search(target) </code></p>
|
232
|
+
<p>Initialize</p>
|
197
233
|
</li></ul>
|
198
234
|
|
235
|
+
<pre class="code ruby"><code class="ruby"><span class='id identifier rubyid_linked_list'>linked_list</span> <span class='op'>=</span> <span class='const'>LinkedList</span><span class='period'>.</span><span class='id identifier rubyid_new'>new</span>
|
236
|
+
</code></pre>
|
237
|
+
<ul><li>
|
238
|
+
<p>Insertion</p>
|
239
|
+
</li></ul>
|
240
|
+
|
241
|
+
<pre class="code ruby"><code class="ruby"><span class='comment'># returns nil
|
242
|
+
</span><span class='id identifier rubyid_value'>value</span> <span class='op'>=</span> <span class='int'>6</span>
|
243
|
+
<span class='id identifier rubyid_linked_list'>linked_list</span><span class='period'>.</span><span class='id identifier rubyid_insert'>insert</span><span class='lparen'>(</span><span class='id identifier rubyid_value'>value</span><span class='rparen'>)</span>
|
244
|
+
</code></pre>
|
245
|
+
<ul><li>
|
246
|
+
<p>Search</p>
|
247
|
+
</li></ul>
|
248
|
+
|
249
|
+
<pre class="code ruby"><code class="ruby"><span class='comment'># returns true if found, else returns false
|
250
|
+
</span><span class='id identifier rubyid_target'>target</span> <span class='op'>=</span> <span class='int'>4</span>
|
251
|
+
<span class='id identifier rubyid_linked_list'>linked_list</span><span class='period'>.</span><span class='id identifier rubyid_search'>search</span><span class='lparen'>(</span><span class='id identifier rubyid_target'>target</span><span class='rparen'>)</span>
|
252
|
+
</code></pre>
|
253
|
+
|
199
254
|
<h4 id="label-Binary+Search+Tree">Binary Search Tree</h4>
|
200
255
|
<ul><li>
|
201
|
-
<p>Initialize
|
202
|
-
</li><li>
|
203
|
-
<p>Insertion <code>ruby # returns nil value = 6
|
204
|
-
binary_tree.insert(value) </code></p>
|
205
|
-
</li><li>
|
206
|
-
<p>Search <code>ruby # returns true if found, else returns false target =
|
207
|
-
4 binary_tree.search(target) </code></p>
|
256
|
+
<p>Initialize</p>
|
208
257
|
</li></ul>
|
209
258
|
|
259
|
+
<pre class="code ruby"><code class="ruby"><span class='id identifier rubyid_binary_tree'>binary_tree</span> <span class='op'>=</span> <span class='const'>BinaryTree</span><span class='period'>.</span><span class='id identifier rubyid_new'>new</span>
|
260
|
+
</code></pre>
|
261
|
+
<ul><li>
|
262
|
+
<p>Insertion</p>
|
263
|
+
</li></ul>
|
264
|
+
|
265
|
+
<pre class="code ruby"><code class="ruby"><span class='comment'># returns nil
|
266
|
+
</span><span class='id identifier rubyid_value'>value</span> <span class='op'>=</span> <span class='int'>6</span>
|
267
|
+
<span class='id identifier rubyid_binary_tree'>binary_tree</span><span class='period'>.</span><span class='id identifier rubyid_insert'>insert</span><span class='lparen'>(</span><span class='id identifier rubyid_value'>value</span><span class='rparen'>)</span>
|
268
|
+
</code></pre>
|
269
|
+
<ul><li>
|
270
|
+
<p>Search</p>
|
271
|
+
</li></ul>
|
272
|
+
|
273
|
+
<pre class="code ruby"><code class="ruby"><span class='comment'># returns true if found, else returns false
|
274
|
+
</span><span class='id identifier rubyid_target'>target</span> <span class='op'>=</span> <span class='int'>4</span>
|
275
|
+
<span class='id identifier rubyid_binary_tree'>binary_tree</span><span class='period'>.</span><span class='id identifier rubyid_search'>search</span><span class='lparen'>(</span><span class='id identifier rubyid_target'>target</span><span class='rparen'>)</span>
|
276
|
+
</code></pre>
|
277
|
+
|
210
278
|
<h2 id="label-Installation">Installation</h2>
|
211
279
|
|
212
280
|
<p>Add this line to your application's Gemfile:</p>
|
@@ -244,7 +312,7 @@ href="http://opensource.org/licenses/MIT">MIT License</a>.</p>
|
|
244
312
|
</div></div>
|
245
313
|
|
246
314
|
<div id="footer">
|
247
|
-
Generated on Sat Jul 23 23:
|
315
|
+
Generated on Sat Jul 23 23:45:47 2016 by
|
248
316
|
<a href="http://yardoc.org" title="Yay! A Ruby Documentation Tool" target="_parent">yard</a>
|
249
317
|
0.9.4 (ruby-2.1.2).
|
250
318
|
</div>
|
@@ -104,7 +104,7 @@
|
|
104
104
|
</div>
|
105
105
|
|
106
106
|
<div id="footer">
|
107
|
-
Generated on Sat Jul 23 23:
|
107
|
+
Generated on Sat Jul 23 23:45:47 2016 by
|
108
108
|
<a href="http://yardoc.org" title="Yay! A Ruby Documentation Tool" target="_parent">yard</a>
|
109
109
|
0.9.4 (ruby-2.1.2).
|
110
110
|
</div>
|