@@ -0,0 +1,180 @@
1+<!DOCTYPE html> <html> <head> <title>algos.js</title> <meta http-equiv="content-type" content="text/html; charset=UTF-8"> <link rel="stylesheet" media="all" href="docco.css" /> </head> <body> <div id="container"> <div id="background"></div> <table cellpadding="0" cellspacing="0"> <thead> <tr> <th class="docs"> <h1> algos.js </h1> </th> <th class="code"> </th> </tr> </th …
2+<span class="s1">'use strict'</span><span class="p">;</span>
3+<span class="kd">var</span> <span class="nx">algos</span> <span class="o">=</span> <span class="p">{};</span></pre></div> </td> </tr> <tr id="section-2"> <td class="docs"> <div class="pilwrap"> <a class="pilcrow" href="#section-2">¶</a> </div> <h1>Insertion sort, the stable sort.</h1>
4+
5+<p>resources:
6+https://www.khanacademy.org/science/computer-science/v/insertion-sort-algorithm
7+http://www.nczonline.net/blog/2012/09/17/computer-science-in-javascript-insertion-sort/</p> </td> <td class="code"> <div class="highlight"><pre><span class="kd">var</span> <span class="nx">insertionSort</span><span class="p">;</span></pre></div> </td> </tr> <tr id="section-3"> <td class="docs"> <div class="pilwrap"> <a class="pilcrow" href="#section-3">¶</a> …
8+each one had a marble with a value written on it. To order the values on the balls we start
9+with the second cup from the left and take the ball out. Now compare the value of the loose
10+ball with the value of the ball in the cup to the left of the empty cup. If the value is
11+greater then we grab that ball and move it to the now empty cup. Continue to do this while the
12+values of the balls in the cups to the left are greater than the loose balls vlaue. Once you
13+reach the last cup on the left or a value that is lesser than the loose ball's value, just
14+place the loose ball in the empty cup and move right to the next cup.
15+By the time you reach the last cup on the right, you'll have sorted the balls per their values
16+in ascending order.</p> </td> <td class="code"> <div class="highlight"><pre><span class="nx">insertionSort</span> <span class="o">=</span> <span class="nx">algos</span><span class="p">.</span><span class="nx">insertionSort</span> <span class="o">=</span> <span class="kd">function</span> <span class="p">(</span><span class="nx">list</span><span class="p">)</span> <span class="p">{</span>
17+ <span class="kd">var</span> <span class="nx">len</span> <span class="o">=</span> <span class="nx">list</span><span class="p">.</span><span class="nx">length</span><span class="p">,</span>
18+ <span class="nx">val</span><span class="p">,</span>
19+ <span class="nx">i</span><span class="p">,</span>
20+ <span class="nx">hole</span><span class="p">;</span>
21+
22+ <span class="k">for</span> <span class="p">(</span><span class="nx">i</span> <span class="o">=</span> <span class="mi">1</span><span class="p">;</span> <span class="nx">i</span> <span class="o"><</span> <span class="nx">len</span><span class="p">;</span> <span class="nx">i</span> <span class="o">+=</span> <span class="mi">1</span><span class="p">)</span> <span class="p">{</span>
23+
24+ <span class="nx">val</span> <span class="o">=</span> <span class="nx">list</span><span class="p">[</span><span class="nx">i</span><span class="p">];</span>
25+ <span class="nx">hole</span> <span class="o">=</span> <span class="nx">i</span><span class="p">;</span>
26+
27+ <span class="k">while</span> <span class="p">(</span><span class="nx">hole</span> <span class="o">></span> <span class="mi">0</span> <span class="o">&&</span> <span class="nx">val</span> <span class="o"><</span> <span class="nx">list</span><span class="p">[</span><span class="nx">hole</span> <span class="o">-</span> <span class="mi">1</span><span class="p">])</span> <span class="p">{</span>
28+ <span class="nx">list</span><span class="p">[</span><span class="nx">hole</span><span class="p">]</span> <span class="o">=</span> <span class="nx">list</span><span class="p">[</span><span class="nx">hole</span> <span class="o">-</span> <span class="mi">1</span><span class="p">];</span>
29+ <span class="nx">hole</span> <span class="o">-=</span> <span class="mi">1</span><span class="p">;</span>
30+ <span class="p">}</span>
31+
32+ <span class="nx">list</span><span class="p">[</span><span class="nx">hole</span><span class="p">]</span> <span class="o">=</span> <span class="nx">val</span><span class="p">;</span>
33+
34+ <span class="p">}</span>
35+
36+ <span class="k">return</span> <span class="nx">list</span><span class="p">;</span>
37+
38+<span class="p">};</span></pre></div> </td> </tr> <tr id="section-4"> <td class="docs"> <div class="pilwrap"> <a class="pilcrow" href="#section-4">¶</a> </div> <h1>Let's try merge sort, seems cool.</h1> </td> <td class="code"> <div class="highlight"><pre><span class="kd">var</span> <span class="nx">join</span><span class="p">,</span>
39+ <span class="nx">mergeSort</span><span class="p">;</span></pre></div> </td> </tr> <tr id="section-5"> <td class="docs"> <div class="pilwrap"> <a class="pilcrow" href="#section-5">¶</a> </div> <p>Join two sorted arrays together.</p>
40+
41+<p>Create two pointers, one for each list, point them both to the value
42+at index 0. Keep comparing the idexes values and keep the lowest in the
43+joined list, increment by 1 the respective index. Do this until one of
44+the indexes matches the length of it's list.
45+Simple pile up the remainder of the orther list at the end of the joined
46+result. Ta-Da!</p> </td> <td class="code"> <div class="highlight"><pre><span class="nx">join</span> <span class="o">=</span> <span class="kd">function</span> <span class="p">(</span><span class="nx">a</span><span class="p">,</span> <span class="nx">b</span><span class="p">)</span> <span class="p">{</span>
47+ <span class="kd">var</span> <span class="nx">joined</span> <span class="o">=</span> <span class="p">[],</span>
48+ <span class="nx">ai</span> <span class="o">=</span> <span class="mi">0</span><span class="p">,</span>
49+ <span class="nx">bi</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span>
50+
51+ <span class="k">while</span> <span class="p">(</span><span class="nx">ai</span> <span class="o"><</span> <span class="nx">a</span><span class="p">.</span><span class="nx">length</span> <span class="o">&&</span> <span class="nx">bi</span> <span class="o"><</span> <span class="nx">b</span><span class="p">.</span><span class="nx">length</span><span class="p">)</span> <span class="p">{</span>
52+ <span class="k">if</span> <span class="p">(</span><span class="nx">a</span><span class="p">[</span><span class="nx">ai</span><span class="p">]</span> <span class="o"><</span> <span class="nx">b</span><span class="p">[</span><span class="nx">bi</span><span class="p">])</span> <span class="p">{</span>
53+ <span class="nx">joined</span><span class="p">.</span><span class="nx">push</span><span class="p">(</span><span class="nx">a</span><span class="p">[</span><span class="nx">ai</span><span class="p">]);</span>
54+ <span class="nx">ai</span> <span class="o">+=</span> <span class="mi">1</span><span class="p">;</span>
55+ <span class="p">}</span> <span class="k">else</span> <span class="p">{</span>
56+ <span class="nx">joined</span><span class="p">.</span><span class="nx">push</span><span class="p">(</span><span class="nx">b</span><span class="p">[</span><span class="nx">bi</span><span class="p">]);</span>
57+ <span class="nx">bi</span> <span class="o">+=</span> <span class="mi">1</span><span class="p">;</span>
58+ <span class="p">}</span>
59+ <span class="p">}</span>
60+
61+ <span class="k">return</span> <span class="nx">joined</span><span class="p">.</span><span class="nx">concat</span><span class="p">(</span><span class="nx">a</span><span class="p">.</span><span class="nx">slice</span><span class="p">(</span><span class="nx">ai</span><span class="p">).</span><span class="nx">concat</span><span class="p">(</span><span class="nx">b</span><span class="p">.</span><span class="nx">slice</span><span class="p">(</span><span class="nx">bi</span><span class="p">)));</s …
62+
63+<span class="p">};</span></pre></div> </td> </tr> <tr id="section-6"> <td class="docs"> <div class="pilwrap"> <a class="pilcrow" href="#section-6">¶</a> </div> <p>Now for the cool part</p>
64+
65+<p>Don't you love recursion? Base case is a single item list, that needs no
66+sort and can be returned as is. The recursive step finds a middle to the
67+list and cuts it in half.
68+We return the recursive call, so that we keep on splitting smaller and
69+smaller lists until their are of a single item, and then we return them
70+as we pile them back up in order one by one.</p> </td> <td class="code"> <div class="highlight"><pre><span class="nx">mergeSort</span> <span class="o">=</span> <span class="nx">algos</span><span class="p">.</span><span class="nx">mergeSort</span> <span class="o">=</span> <span class="kd">function</span> <span class="p">(</span><span class="nx">list</span><span class="p">)</span> <span class="p">{</span>
71+
72+ <span class="k">if</span> <span class="p">(</span><span class="nx">list</span><span class="p">.</span><span class="nx">length</span> <span class="o"><=</span> <span class="mi">1</span><span class="p">)</span> <span class="p">{</span>
73+ <span class="k">return</span> <span class="nx">list</span><span class="p">;</span>
74+ <span class="p">}</span>
75+
76+ <span class="kd">var</span> <span class="nx">m</span> <span class="o">=</span> <span class="nb">Math</span><span class="p">.</span><span class="nx">floor</span><span class="p">(</span><span class="nx">list</span><span class="p">.</span><span class="nx">length</span> <span class="o">/</span> <span class="mi">2</span><span class="p">),</span>
77+ <span class="nx">a</span> <span class="o">=</span> <span class="nx">list</span><span class="p">.</span><span class="nx">slice</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="nx">m</span><span class="p">),</span>
78+ <span class="nx">b</span> <span class="o">=</span> <span class="nx">list</span><span class="p">.</span><span class="nx">slice</span><span class="p">(</span><span class="nx">m</span><span class="p">);</span>
79+
80+ <span class="k">return</span> <span class="nx">join</span><span class="p">(</span><span class="nx">mergeSort</span><span class="p">(</span><span class="nx">a</span><span class="p">),</span> <span class="nx">mergeSort</span><span class="p">(</span><span class="nx">b</span><span class="p">));</span>
81+
82+<span class="p">};</span></pre></div> </td> </tr> <tr id="section-7"> <td class="docs"> <div class="pilwrap"> <a class="pilcrow" href="#section-7">¶</a> </div> <h1>quick sort baby!</h1>
83+
84+<p>Chome's V8 uses this for Array.sort() for larger arrays (length 20ish or more)
85+much more to be found about quicksort here http://www.nczonline.net/blog/2012/11/27/computer-science-in-javascript-quicksort/</p> </td> <td class="code"> <div class="highlight"><pre><span class="kd">var</span> <span class="nx">swap</span><span class="p">,</span>
86+ <span class="nx">partition</span><span class="p">,</span>
87+ <span class="nx">quickSort</span><span class="p">;</span></pre></div> </td> </tr> <tr id="section-8"> <td class="docs"> <div class="pilwrap"> <a class="pilcrow" href="#section-8">¶</a> </div> <p>easy peasy swap function.</p>
88+
89+<p>think 3 glasses, a red one with beer, a blue one with wine, and a white empty one.
90+we want the beer in the blue glass and the wine in the red one.
91+pour the beer in the white one,
92+pour the wine in the red one,
93+pour the beer into the blue one.</p> </td> <td class="code"> <div class="highlight"><pre><span class="nx">swap</span> <span class="o">=</span> <span class="kd">function</span> <span class="p">(</span><span class="nx">list</span><span class="p">,</span> <span class="nx">first</span><span class="p">,</span> <span class="nx">second</span><span class="p">)</span> <span class="p">{</span>
94+ <span class="kd">var</span> <span class="nx">tmp</span> <span class="o">=</span> <span class="nx">list</span><span class="p">[</span><span class="nx">first</span><span class="p">];</span>
95+ <span class="nx">list</span><span class="p">[</span><span class="nx">first</span><span class="p">]</span> <span class="o">=</span> <span class="nx">list</span><span class="p">[</span><span class="nx">second</span><span class="p">];</span>
96+ <span class="nx">list</span><span class="p">[</span><span class="nx">second</span><span class="p">]</span> <span class="o">=</span> <span class="nx">tmp</span><span class="p">;</span>
97+<span class="p">};</span></pre></div> </td> </tr> <tr id="section-9"> <td class="docs"> <div class="pilwrap"> <a class="pilcrow" href="#section-9">¶</a> </div> <p>creates a smaller partition of the array</p>
98+
99+<p>starting with a middle point because if the array is sorted you'll get
100+the worst possible performance if you choose the first or last elements.
101+while the left pointer is smaller or equal to the right pointer
102+move the left pointer to the right while it's value is less than the middle's value.
103+after, move the right pointer to the left while it's value is greater than the middle's value.
104+if the left pointer is smaller or equal to the right pointer swap the pointers values.
105+move the pointers one more time in each direction so that we continue in the correct direction.
106+return the left pointer so it can be used as the starting point for the next partition.</p> </td> <td class="code"> <div class="highlight"><pre><span class="nx">partition</span> <span class="o">=</span> <span class="kd">function</span> <span class="p">(</span><span class="nx">list</span><span class="p">,</span> <span class="nx">left</span><span class="p">,</span> <span class="nx">right</span><span class="p">)</span> <span class="p">{</span>
107+ <span class="kd">var</span> <span class="nx">pivot</span> <span class="o">=</span> <span class="nx">list</span><span class="p">[</span><span class="nb">Math</span><span class="p">.</span><span class="nx">floor</span><span class="p">(</span> <span class="p">(</span><span class="nx">left</span> <span class="o">+</span> <span class="nx">right</span><span class="p">)</span> <span class="o">/</span> <span class="mi">2</span> <span class="p">)];</span>
108+
109+ <span class="k">while</span> <span class="p">(</span><span class="nx">left</span> <span class="o"><=</span> <span class="nx">right</span><span class="p">)</span> <span class="p">{</span>
110+
111+ <span class="k">while</span> <span class="p">(</span><span class="nx">list</span><span class="p">[</span><span class="nx">left</span><span class="p">]</span> <span class="o"><</span> <span class="nx">pivot</span><span class="p">)</span> <span class="p">{</span>
112+ <span class="nx">left</span> <span class="o">+=</span> <span class="mi">1</span><span class="p">;</span>
113+ <span class="p">}</span>
114+
115+ <span class="k">while</span> <span class="p">(</span><span class="nx">list</span><span class="p">[</span><span class="nx">right</span><span class="p">]</span> <span class="o">></span> <span class="nx">pivot</span><span class="p">)</span> <span class="p">{</span>
116+ <span class="nx">right</span> <span class="o">-=</span> <span class="mi">1</span><span class="p">;</span>
117+ <span class="p">}</span>
118+
119+ <span class="k">if</span> <span class="p">(</span><span class="nx">left</span> <span class="o"><=</span> <span class="nx">right</span><span class="p">)</span> <span class="p">{</span>
120+ <span class="nx">swap</span><span class="p">(</span><span class="nx">list</span><span class="p">,</span> <span class="nx">left</span><span class="p">,</span> <span class="nx">right</span><span class="p">);</span>
121+ <span class="nx">left</span> <span class="o">+=</span> <span class="mi">1</span><span class="p">;</span>
122+ <span class="nx">right</span> <span class="o">-=</span> <span class="mi">1</span><span class="p">;</span>
123+ <span class="p">}</span>
124+
125+ <span class="p">}</span>
126+
127+ <span class="k">return</span> <span class="nx">left</span><span class="p">;</span>
128+<span class="p">};</span></pre></div> </td> </tr> <tr id="section-10"> <td class="docs"> <div class="pilwrap"> <a class="pilcrow" href="#section-10">¶</a> </div> <p>Only operate on lists with 2 or more values.
129+use default values for left and right if they are undefined (first run).
130+partition the array.
131+if the left pointer can still be moved right towards the index, call quicksort again in that direction.
132+if the right pointer can be moved left, call quicksort from the current index.</p> </td> <td class="code"> <div class="highlight"><pre><span class="nx">quickSort</span> <span class="o">=</span> <span class="nx">algos</span><span class="p">.</span><span class="nx">quickSort</span> <span class="o">=</span> <span class="kd">function</span> <span class="p">(</span><span class="nx">list</span><span class="p">,</span> <span class="nx">left</span><span class="p">,< …
133+ <span class="kd">var</span> <span class="nx">idx</span><span class="p">;</span>
134+
135+ <span class="k">if</span> <span class="p">(</span><span class="nx">list</span><span class="p">.</span><span class="nx">length</span> <span class="o">>=</span> <span class="mi">2</span><span class="p">)</span> <span class="p">{</span>
136+
137+ <span class="nx">left</span> <span class="o">=</span> <span class="nx">left</span> <span class="o">===</span> <span class="kc">undefined</span> <span class="o">?</span> <span class="mi">0</span> <span class="o">:</span> <span class="nx">left</span><span class="p">;</span>
138+ <span class="nx">right</span> <span class="o">=</span> <span class="nx">right</span> <span class="o">===</span> <span class="kc">undefined</span> <span class="o">?</span> <span class="nx">list</span><span class="p">.</span><span class="nx">length</span> <span class="o">-</span> <span class="mi">1</span> <span class="o">:</span> <span class="nx">right</span><span class="p">;</span>
139+
140+ <span class="nx">idx</span> <span class="o">=</span> <span class="nx">partition</span><span class="p">(</span><span class="nx">list</span><span class="p">,</span> <span class="nx">left</span><span class="p">,</span> <span class="nx">right</span><span class="p">);</span>
141+
142+ <span class="k">if</span> <span class="p">(</span><span class="nx">left</span> <span class="o"><</span> <span class="nx">idx</span> <span class="o">-</span> <span class="mi">1</span><span class="p">)</span> <span class="p">{</span>
143+ <span class="nx">quickSort</span><span class="p">(</span><span class="nx">list</span><span class="p">,</span> <span class="nx">left</span><span class="p">,</span> <span class="nx">idx</span> <span class="o">-</span> <span class="mi">1</span><span class="p">);</span>
144+ <span class="p">}</span>
145+
146+ <span class="k">if</span> <span class="p">(</span><span class="nx">idx</span> <span class="o"><</span> <span class="nx">right</span><span class="p">)</span> <span class="p">{</span>
147+ <span class="nx">quickSort</span><span class="p">(</span><span class="nx">list</span><span class="p">,</span> <span class="nx">idx</span><span class="p">,</span> <span class="nx">right</span><span class="p">);</span>
148+ <span class="p">}</span>
149+ <span class="p">}</span>
150+
151+ <span class="k">return</span> <span class="nx">list</span><span class="p">;</span>
152+<span class="p">};</span></pre></div> </td> </tr> <tr id="section-11"> <td class="docs"> <div class="pilwrap"> <a class="pilcrow" href="#section-11">¶</a> </div> <h1>Bubble sort, aka blubbly</h1> </td> <td class="code"> <div class="highlight"><pre><span class="kd">var</span> <span class="nx">bubbleSort</span><span class="p">;</span>< …
153+higher values to the top. VERY SLOW! n^2 slow...</p> </td> <td class="code"> <div class="highlight"><pre><span class="nx">bubbleSort</span> <span class="o">=</span> <span class="nx">algos</span><span class="p">.</span><span class="nx">bubbleSort</span> <span class="o">=</span> <span class="kd">function</span> <span class="p">(</span><span class="nx">list</span><span class="p">)</span> <span class="p">{</span>
154+ <span class="kd">var</span> <span class="nx">len</span> <span class="o">=</span> <span class="nx">list</span><span class="p">.</span><span class="nx">length</span><span class="p">,</span>
155+ <span class="nx">i</span><span class="p">,</span>
156+ <span class="nx">j</span><span class="p">;</span>
157+
158+ <span class="k">for</span> <span class="p">(</span><span class="nx">i</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> <span class="nx">i</span> <span class="o"><</span> <span class="nx">len</span><span class="p">;</span> <span class="nx">i</span> <span class="o">+=</span> <span class="mi">1</span><span class="p">)</span> <span class="p">{</span>
159+ <span class="k">for</span> <span class="p">(</span><span class="nx">j</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> <span class="nx">j</span> <span class="o"><</span> <span class="p">(</span><span class="nx">len</span> <span class="o">-</span> <span class="nx">i</span><span class="p">);</span> <span class="nx">j</span> <span class="o">+=</span> <span class="mi">1</span><span class="p">)</span> <span class="p">{</span>
160+ <span class="k">if</span> <span class="p">(</span><span class="nx">list</span><span class="p">[</span><span class="nx">j</span><span class="p">]</span> <span class="o">></span> <span class="nx">list</span><span class="p">[</span><span class="nx">j</span> <span class="o">+</span> <span class="mi">1</span><span class="p">])</span> <span class="p">{</span>
161+ <span class="nx">swap</span><span class="p">(</span><span class="nx">list</span><span class="p">,</span> <span class="nx">j</span><span class="p">,</span> <span class="nx">j</span> <span class="o">+</span> <span class="mi">1</span><span class="p">);</span>
162+ <span class="p">}</span>
163+ <span class="p">}</span>
164+ <span class="p">}</span>
165+
166+ <span class="k">return</span> <span class="nx">list</span><span class="p">;</span>
167+<span class="p">};</span></pre></div> </td> </tr> <tr id="section-13"> <td class="docs"> <div class="pilwrap"> <a class="pilcrow" href="#section-13">¶</a> </div> <h1>shuffle, make a mess of things...</h1> </td> <td class="code"> <div class="highlight"><pre><span class="kd">var</span> <span class="nx">shuffle</span><span class="p">;</ …
168+for each item in the array, create a random number within the length and swap.</p> </td> <td class="code"> <div class="highlight"><pre><span class="nx">shuffle</span> <span class="o">=</span> <span class="nx">algos</span><span class="p">.</span><span class="nx">shuffle</span> <span class="o">=</span> <span class="kd">function</span> <span class="p">(</span><span class="nx">list</span><span class="p">)</span> <span class="p">{</span>
169+ <span class="kd">var</span> <span class="nx">len</span> <span class="o">=</span> <span class="nx">list</span><span class="p">.</span><span class="nx">length</span><span class="p">,</span>
170+ <span class="nx">max</span> <span class="o">=</span> <span class="nx">len</span> <span class="o">-</span> <span class="mi">1</span><span class="p">;</span>
171+
172+ <span class="k">while</span> <span class="p">(</span><span class="nx">len</span><span class="p">)</span> <span class="p">{</span>
173+ <span class="nx">len</span> <span class="o">-=</span> <span class="mi">1</span><span class="p">;</span>
174+ <span class="nx">swap</span><span class="p">(</span><span class="nx">list</span><span class="p">,</span> <span class="nx">len</span><span class="p">,</span> <span class="nb">Math</span><span class="p">.</span><span class="nx">floor</span><span class="p">(</span> <span class="nb">Math</span><span class="p">.</span><span class="nx">random</span><span class="p">()</span> <span class="o">*</span> <span class="nx">max</span> <span class="p">));</span>
175+ <span class="p">}</span>
176+
177+ <span class="k">return</span> <span class="nx">list</span><span class="p">;</span>
178+<span class="p">};</span>
179+
180+</pre></div> </td> </tr> </tbody> </table> </div> </body> </html>