Merge branch 'main' of https://github.com/shafiqihtsham/SortingVisual…

…izer

README.md

@@ -5,13 +5,63 @@
 ![image](https://github.com/shafiqihtsham/SortingVisualizer/assets/108529942/2c3a5e89-2ec4-47b8-adfc-530838d0a519)
 
 
-## Current algorithms : 
+### Current algorithms : 
 
-- Bubble Sort
-- Insertion Sort
-- Merge Sort
-- Quicksort
-- Heap Sort
+<table class="tg">
+<thead>
+  <tr>
+    <th class="tg-0pky">Algorithm</th>
+    <th class="tg-c3ow">Time Complexity</th>
+    <th class="tg-c3ow"></th>
+    <th class="tg-c3ow"></th>
+    <th class="tg-0pky">Space Complexity</th>
+  </tr>
+</thead>
+<tbody>
+  <tr>
+    <td class="tg-0pky"></td>
+    <td class="tg-0pky">Best </td>
+    <td class="tg-0pky">Average</td>
+    <td class="tg-0pky">Worst</td>
+    <td class="tg-0pky">Worst</td>
+  </tr>
+  <tr>
+    <td class="tg-0pky">Quicksort</td>
+    <td class="tg-0pky">Ω(n log(n))</td>
+    <td class="tg-0pky">Θ(n log(n))</td>
+    <td class="tg-0pky">O(n^2)</td>
+    <td class="tg-0pky">O(log(n))</td>
+  </tr>
+  <tr>
+    <td class="tg-0pky">Mergesort</td>
+    <td class="tg-0pky">Ω(n log(n))</td>
+    <td class="tg-0pky">Θ(n log(n))</td>
+    <td class="tg-0pky">O(n log(n))</td>
+    <td class="tg-0pky">O(n)</td>
+  </tr>
+  <tr>
+    <td class="tg-0pky">Heapsort</td>
+    <td class="tg-0pky">Ω(n log(n))</td>
+    <td class="tg-0pky">Θ(n log(n))</td>
+    <td class="tg-0pky">O(n log(n))</td>
+    <td class="tg-0pky">O(1)</td>
+  </tr>
+  <tr>
+    <td class="tg-0pky">Bubble Sort</td>
+    <td class="tg-0pky">Ω(n)</td>
+    <td class="tg-0pky">Θ(n^2)</td>
+    <td class="tg-0pky">O(n^2)</td>
+    <td class="tg-0pky">O(1)</td>
+  </tr>
+  <tr>
+    <td class="tg-0pky">Insertion Sort</td>
+    <td class="tg-0pky">Ω(n)</td>
+    <td class="tg-0pky">Θ(n^2)</td>
+    <td class="tg-0pky">O(n^2)</td>
+    <td class="tg-0pky">O(1)</td>
+  </tr>
+</tbody>
+</table>
 
 ## Todo :