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

Fix: change CSS class of O(n+k) and O(n) to yellow (it is not better than O(n) wich is yellow) #168

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Fix: change CSS class of O(n+k) and O(n) to yellow (it is not better than O(n) wich is yellow) #168

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
16 changes: 8 additions & 8 deletions Tables.html
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -276,23 +276,23 @@ <h2 id="sorting">Array Sorting Algorithms</h2>
</tr>
<tr>
<td><a rel="tooltip" title="Only for integers. k is a number of buckets" href="http://en.wikipedia.org/wiki/Bucket_sort">Bucket Sort</a></td>
<td><code class="green">&Omega;(n+k)</code></td>
<td><code class="green">&Theta;(n+k)</code></td>
<td><code class="yellow">&Omega;(n+k)</code></td>
<td><code class="yellow">&Theta;(n+k)</code></td>
<td><code class="red">O(n^2)</code></td>
<td><code class="yellow">O(n)</code></td>
</tr>
<tr>
<td><a rel="tooltip" title="Constant number of digits 'k'" href="http://en.wikipedia.org/wiki/Radix_sort">Radix Sort</a></td>
<td><code class="green">&Omega;(nk)</code></td>
<td><code class="green">&Theta;(nk)</code></td>
<td><code class="green">O(nk)</code></td>
<td><code class="yellow">&Omega;(nk)</code></td>
<td><code class="yellow">&Theta;(nk)</code></td>
<td><code class="yellow">O(nk)</code></td>
<td><code class="yellow">O(n+k)</code></td>
</tr>
<tr>
<td><a rel="tooltip" title="Difference between maximum and minimum number 'k'" href="https://en.wikipedia.org/wiki/Counting_sort">Counting Sort</a></td>
<td><code class="green">&Omega;(n+k)</code></td>
<td><code class="green">&Theta;(n+k)</code></td>
<td><code class="green">O(n+k)</code></td>
<td><code class="yellow">&Omega;(n+k)</code></td>
<td><code class="yellow">&Theta;(n+k)</code></td>
<td><code class="yellow">O(n+k)</code></td>
<td><code class="yellow">O(k)</code></td>
</tr>
<tr>
Expand Down