Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Standardize application of color css classes #55

Merged
merged 2 commits into from
Mar 16, 2015
Merged

Standardize application of color css classes #55

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
86d587d
Standardize coloring in Sorting table.
jhamon Nov 27, 2013
a8e849a
Standardize coloring in Data Structures table.
jhamon Nov 27, 2013
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
56 changes: 28 additions & 28 deletions Tables.html
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -117,7 +117,7 @@ <h2 id="sorting">Sorting</h2>
<td><code class="yellow">O(n log(n))</code></td>
<td><code class="green">O(n log(n))</code></td>
<td><code class="green">O(n log(n))</code></td>
<td><code class="red">O(n)</code></td>
<td><code class="yellow">O(n)</code></td>
</tr>
<tr>
<td><a href="http://en.wikipedia.org/wiki/Heapsort">Heapsort</a></td>
Expand Down Expand Up @@ -251,9 +251,9 @@ <h2 id="data-structures">Data Structures</h2>
<td><a href="http://en.wikipedia.org/wiki/Skip_list">Skip List</a></td>

<td><code class="yellow">O(log(n))</code></td>
<td><code class="green">O(log(n))</code></td>
<td><code class="green">O(log(n))</code></td>
<td><code class="green">O(log(n))</code></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code class="red">O(n)</code></td>
<td><code class="red">O(n)</code></td>
<td><code class="red">O(n)</code></td>
Expand All @@ -275,9 +275,9 @@ <h2 id="data-structures">Data Structures</h2>
<tr>
<td><a href="http://en.wikipedia.org/wiki/Binary_search_tree">Binary Search Tree</a></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code class="green">O(log(n))</code></td>
<td><code class="green">O(log(n))</code></td>
<td><code class="green">O(log(n))</code></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code class="red">O(n)</code></td>
<td><code class="red">O(n)</code></td>
<td><code class="red">O(n)</code></td>
Expand All @@ -287,9 +287,9 @@ <h2 id="data-structures">Data Structures</h2>
<tr>
<td><a href="https://en.wikipedia.org/wiki/Cartesian_tree">Cartresian Tree</a></td>
<td><code>-</code></td>
<td><code class="green">O(log(n))</code></td>
<td><code class="green">O(log(n))</code></td>
<td><code class="green">O(log(n))</code></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code>-</code></td>
<td><code class="red">O(n)</code></td>
<td><code class="red">O(n)</code></td>
Expand All @@ -311,37 +311,37 @@ <h2 id="data-structures">Data Structures</h2>
<tr>
<td><a href="http://en.wikipedia.org/wiki/Red-black_tree">Red-Black Tree</a></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code class="green">O(log(n))</code></td>
<td><code class="green">O(log(n))</code></td>
<td><code class="green">O(log(n))</code></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code class="green">O(log(n))</code></td>
<td><code class="green">O(log(n))</code></td>
<td><code class="green">O(log(n))</code></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code class="yellow">O(n)</code></td>
</tr>
<tr>
<td><a href="https://en.wikipedia.org/wiki/Splay_tree">Splay Tree</a></td>
<td><code>-</code></td>
<td><code class="green">O(log(n))</code></td>
<td><code class="green">O(log(n))</code></td>
<td><code class="green">O(log(n))</code></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code>-</code></td>
<td><code class="green">O(log(n))</code></td>
<td><code class="green">O(log(n))</code></td>
<td><code class="green">O(log(n))</code></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code class="yellow">O(n)</code></td>
</tr>
<tr>
<td><a href="http://en.wikipedia.org/wiki/AVL_tree">AVL Tree</a></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code class="green">O(log(n))</code></td>
<td><code class="green">O(log(n))</code></td>
<td><code class="green">O(log(n))</code></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code class="green">O(log(n))</code></td>
<td><code class="green">O(log(n))</code></td>
<td><code class="green">O(log(n))</code></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code class="yellow">O(log(n))</code></td>
<td><code class="yellow">O(n)</code></td>
</tr>
</tbody>
Expand Down