more cleanup

Tables.html

@@ -1,4 +1,4 @@
-<h2 id="data-structures">Data Structures</h2>
+<h2 id="data-structures">Data Structure Operations</h2>
 <table class="table table-bordered table-striped">
   <thead>
     <tr>
@@ -221,7 +221,7 @@ <h2 id="sorting">Sorting Arrays</h2>
       <td><code class="green">O(n)</code></td>
       <td><code class="orange">O(n log(n))</code></td>
       <td><code class="orange">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>
@@ -275,77 +275,7 @@ <h2 id="sorting">Sorting Arrays</h2>
   </tbody>
 </table>
 
-<h2 id="searching">Searching</h2>
-<table class="table table-bordered table-striped">
-  <thead>
-    <tr>
-      <th>Algorithm</th>
-      <th>Data Structure</th>
-      <th colspan="2">Time Complexity</th>
-      <th>Space Complexity</th>
-    </tr>
-    <tr>
-      <th></th>
-      <th></th>
-      <th>Average</th>  
-      <th>Worst</th> 
-      <th>Worst</th>                
-    </tr>
-  </thead>
-  <tbody>
-    <tr>
-      <td><a href="http://en.wikipedia.org/wiki/Depth-first_search">Depth First Search (DFS)</a></td>
-      <td>Graph of |V| vertices and |E| edges</td>
-      <td><code>-</code></td>
-      <td><code class="green">O(|E| + |V|)</code></td>
-      <td><code class="green">O(|V|)</code></td>
-    </tr>
-    <tr>
-      <td><a href="http://en.wikipedia.org/wiki/Breadth-first_search">Breadth First Search (BFS)</a></td>
-      <td>Graph of |V| vertices and |E| edges</td>
-      <td><code>-</code></td>
-      <td><code class="green">O(|E| + |V|)</code></td>
-      <td><code class="green">O(|V|)</code></td>
-    </tr>
-    <tr>
-      <td><a href="http://en.wikipedia.org/wiki/Binary_search_algorithm">Binary search</a></td>
-      <td>Sorted array of n elements</td>
-      <td><code class="yellow-green">O(log(n))</code></td>
-      <td><code class="yellow-green">O(log(n))</code></td>
-      <td><code class="green">O(1)</code></td>
-    </tr>
-    <tr>
-      <td><a href="http://en.wikipedia.org/wiki/Brute-force_search">Linear (Brute Force)</a></td>
-      <td>Unsorted array of n elements</td>
-      <td><code class="red">O(n)</code></td>
-      <td><code class="red">O(n)</code></td>
-      <td><code class="green">O(1)</code></td>
-    </tr>
-    <tr>
-      <td><a href="http://en.wikipedia.org/wiki/Dijkstra's_algorithm">Shortest path by Dijkstra,<br>using a Min-heap as priority queue</a></td>
-      <td>Graph with |V| vertices and |E| edges</td>
-      <td><code class="yellow">O((|V| + |E|) log |V|)</code></td>
-      <td><code class="yellow">O((|V| + |E|) log |V|)</code></td>
-      <td><code class="yellow">O(|V|)</code></td>
-    </tr>
-    <tr>
-      <td><a href="http://en.wikipedia.org/wiki/Dijkstra's_algorithm">Shortest path by Dijkstra,<br>using an unsorted array as priority queue</a></td>
-      <td>Graph with |V| vertices and |E| edges</td>
-      <td><code class="red">O(|V|^2)</code></td>
-      <td><code class="red">O(|V|^2)</code></td>
-      <td><code class="yellow">O(|V|)</code></td>
-    </tr>
-    <tr>
-      <td><a href="http://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm">Shortest path by Bellman-Ford</a></td>
-      <td>Graph with |V| vertices and |E| edges</td>
-      <td><code class="yellow">O(|V||E|)</code></td>
-      <td><code class="yellow">O(|V||E|)</code></td>
-      <td><code class="yellow">O(|V|)</code></td>
-    </tr>
-  </tbody>
-</table>
-
-<h2 id="graphs">Graphs</h2>
+<h2 id="graphs">Graph Operations</h2>
 <table class="table table-bordered table-striped">
   <tbody>
     <tr>
@@ -396,7 +326,7 @@ <h2 id="graphs">Graphs</h2>
   </tbody>
 </table>
 
-<h2 id="heaps">Heaps</h2>
+<h2 id="heaps">Heap Operations</h2>
 <table class="table table-bordered table-striped">
   <thead>
     <tr>