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

Update Tables.html #161

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

Update Tables.html #161

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
53 changes: 53 additions & 0 deletions Tables.html
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -304,3 +304,56 @@ <h2 id="sorting">Array Sorting Algorithms</h2>
</tr>

</table>

<h2 id="sorting">Array Searching Algorithms</h2>
<table class="table table-bordered table-striped">
<tr>
<th>Algorithm</th>
<th colspan="3">Time Complexity</th>
<th>Space Complexity</th>
</tr>
<tr>
<th></th>
<th>Best</th>
<th>Average</th>
<th>Worst</th>
<th>Worst</th>
</tr>

<tr>
<td><a href="https://en.wikipedia.org/wiki/Linear_search">Linear Search</a></td>
<td><code class="yellow">O(1)</code></td>
<td><code class="yellow">O(n)</code></td>
<td><code class="yellow">O(n)</code></td>
<td><code class="green">O(1)</code></td>
</tr>
<tr>
<td><a href="https://en.wikipedia.org/wiki/Binary_search">Binary Search</a></td>
<td><code class="orange">O(1)</code></td>
<td><code class="orange">O(log(n))</code></td>
<td><code class="orange">O(log(n))</code></td>
<td><code class="green">O(1)</code></td>
</tr>
<tr>
<td><a href="https://en.wikipedia.org/wiki/Ternary_search">Ternary Search</a></td>
<td><code class="orange">O(1)</code></td>
<td><code class="orange">O(log3(n))</code></td>
<td><code class="orange">O(log3(n))</code></td>
<td><code class="green">O(1)</code></td>
</tr>
<tr>
<td><a href="https://en.wikipedia.org/wiki/Jump_search">Jump Search</a></td>
<td><code class="orange">O(√n)</code></td>
<td><code class="orange">O(√n)</code></td>
<td><code class="orange">O(√n)</code></td>
<td><code class="green">O(1)</code></td>
</tr>
<tr>
<td><a href="https://en.wikipedia.org/wiki/Exponential_search">Exponential Search</a></td>
<td><code class="orange">O(1)</code></td>
<td><code class="orange">O(log(n))</code></td>
<td><code class="orange">O(log(n))</code></td>
<td><code class="green">O(1)</code></td>
</tr>
</table>