From 071d6ff609c35659eb48f670f46003630792e73e Mon Sep 17 00:00:00 2001
From: Ahmed Mohamed <78971171+ahmedmohmd@users.noreply.github.com>
Date: Sat, 28 Oct 2023 23:26:23 +0200
Subject: [PATCH] Update Tables.html

Add common searching algorithms:
1. Linear Search Algorithm
2. Binary Search Algorithm
3. Ternary Search Algorithm
4. Exponential Search Algorithm
5. Jump Search Algorithm
---
 Tables.html | 53 +++++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 53 insertions(+)

diff --git a/Tables.html b/Tables.html
index 2322456..07e61bc 100644
--- a/Tables.html
+++ b/Tables.html
@@ -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>
+