diff --git a/Tables.html b/Tables.html
index 2322456..b4f746c 100644
--- a/Tables.html
+++ b/Tables.html
@@ -26,7 +26,7 @@ <h2 id="data-structures">Common Data Structure Operations</h2>
     </tr>
 
     <tr>
-      <td><a href="http://en.wikipedia.org/wiki/Array_data_structure">Array</a></td>
+      <td><a href="https://www.geeksforgeeks.org/array-data-structure/?ref=lbp">Array</a></td>
       <td><code class="green">&Theta;(1)</code></td>
       <td><code class="yellow">&Theta;(n)</code></td>
       <td><code class="yellow">&Theta;(n)</code></td>
@@ -38,7 +38,7 @@ <h2 id="data-structures">Common Data Structure Operations</h2>
       <td><code class="yellow">O(n)</code></td>
     </tr>
     <tr>
-      <td><a href="http://en.wikipedia.org/wiki/Stack_(abstract_data_type)">Stack</a></td>
+      <td><a href="https://www.geeksforgeeks.org/stack-data-structure/?ref=lbp">Stack</a></td>
       <td><code class="yellow">&Theta;(n)</code></td>
       <td><code class="yellow">&Theta;(n)</code></td>
       <td><code class="green">&Theta;(1)</code></td>
@@ -50,7 +50,7 @@ <h2 id="data-structures">Common Data Structure Operations</h2>
       <td><code class="yellow">O(n)</code></td>
     </tr>
     <tr>
-      <td><a href="http://en.wikipedia.org/wiki/Queue_(abstract_data_type)">Queue</a></td>
+      <td><a href="https://www.geeksforgeeks.org/queue-data-structure/?ref=lbp">Queue</a></td>
       <td><code class="yellow">&Theta;(n)</code></td>
       <td><code class="yellow">&Theta;(n)</code></td>
       <td><code class="green">&Theta;(1)</code></td>
@@ -62,7 +62,7 @@ <h2 id="data-structures">Common Data Structure Operations</h2>
       <td><code class="yellow">O(n)</code></td>
     </tr>
     <tr>
-      <td><a href="http://en.wikipedia.org/wiki/Singly_linked_list#Singly_linked_lists">Singly-Linked List</a></td>
+      <td><a href="https://www.geeksforgeeks.org/data-structures/linked-list/singly-linked-list/">Singly-Linked List</a></td>
       <td><code class="yellow">&Theta;(n)</code></td>
       <td><code class="yellow">&Theta;(n)</code></td>
       <td><code class="green">&Theta;(1)</code></td>
@@ -74,7 +74,7 @@ <h2 id="data-structures">Common Data Structure Operations</h2>
       <td><code class="yellow">O(n)</code></td>
     </tr>
     <tr>
-      <td><a href="http://en.wikipedia.org/wiki/Doubly_linked_list">Doubly-Linked List</a></td>
+      <td><a href="https://www.geeksforgeeks.org/introduction-and-insertion-in-a-doubly-linked-list/">Doubly-Linked List</a></td>
       <td><code class="yellow">&Theta;(n)</code></td>
       <td><code class="yellow">&Theta;(n)</code></td>
       <td><code class="green">&Theta;(1)</code></td>
@@ -86,7 +86,7 @@ <h2 id="data-structures">Common Data Structure Operations</h2>
       <td><code class="yellow">O(n)</code></td>
     </tr>
     <tr>
-      <td><a href="http://en.wikipedia.org/wiki/Skip_list">Skip List</a></td>
+      <td><a href="https://www.geeksforgeeks.org/skip-list/">Skip List</a></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
@@ -98,7 +98,7 @@ <h2 id="data-structures">Common Data Structure Operations</h2>
       <td><code class="orange">O(n log(n))</code></td>
     </tr>
     <tr>
-      <td><a href="http://en.wikipedia.org/wiki/Hash_table">Hash Table</a></td>
+      <td><a href="https://www.geeksforgeeks.org/hash-table-data-structure/">Hash Table</a></td>
       <td><code class="gray">N/A</code></td>
       <td><code class="green">&Theta;(1)</code></td>
       <td><code class="green">&Theta;(1)</code></td>
@@ -110,7 +110,7 @@ <h2 id="data-structures">Common Data Structure Operations</h2>
       <td><code class="yellow">O(n)</code></td>
     </tr>
     <tr>
-      <td><a href="http://en.wikipedia.org/wiki/Binary_search_tree">Binary Search Tree</a></td>
+      <td><a href="https://www.geeksforgeeks.org/binary-search-tree-data-structure/">Binary Search Tree</a></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
@@ -122,7 +122,7 @@ <h2 id="data-structures">Common Data Structure Operations</h2>
       <td><code class="yellow">O(n)</code></td>
     </tr>
     <tr>
-      <td><a href="https://en.wikipedia.org/wiki/Cartesian_tree">Cartesian Tree</a></td>
+      <td><a href="https://www.geeksforgeeks.org/cartesian-tree/">Cartesian Tree</a></td>
       <td><code class="gray">N/A</code></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
@@ -134,7 +134,7 @@ <h2 id="data-structures">Common Data Structure Operations</h2>
       <td><code class="yellow">O(n)</code></td>
     </tr>
     <tr>
-      <td><a href="http://en.wikipedia.org/wiki/B_tree">B-Tree</a></td>
+      <td><a href="https://www.geeksforgeeks.org/introduction-of-b-tree-2/">B-Tree</a></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
@@ -146,7 +146,7 @@ <h2 id="data-structures">Common Data Structure Operations</h2>
       <td><code class="yellow">O(n)</code></td>
     </tr>
     <tr>
-      <td><a href="http://en.wikipedia.org/wiki/Red-black_tree">Red-Black Tree</a></td>
+      <td><a href="https://www.geeksforgeeks.org/introduction-to-red-black-tree/">Red-Black Tree</a></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
@@ -158,7 +158,7 @@ <h2 id="data-structures">Common Data Structure Operations</h2>
       <td><code class="yellow">O(n)</code></td>
     </tr>
     <tr>
-      <td><a href="https://en.wikipedia.org/wiki/Splay_tree">Splay Tree</a></td>
+      <td><a href="https://www.geeksforgeeks.org/introduction-to-splay-tree-data-structure/">Splay Tree</a></td>
       <td><code class="gray">N/A</code></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
@@ -170,7 +170,7 @@ <h2 id="data-structures">Common Data Structure Operations</h2>
       <td><code class="yellow">O(n)</code></td>
     </tr>
     <tr>
-      <td><a href="http://en.wikipedia.org/wiki/AVL_tree">AVL Tree</a></td>
+      <td><a href="https://www.geeksforgeeks.org/introduction-to-avl-tree/">AVL Tree</a></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
@@ -182,7 +182,7 @@ <h2 id="data-structures">Common Data Structure Operations</h2>
       <td><code class="yellow">O(n)</code></td>
     </tr>
     <tr>
-      <td><a href="http://en.wikipedia.org/wiki/K-d_tree">KD Tree</a></td>
+      <td><a href="https://www.geeksforgeeks.org/search-and-insertion-in-k-dimensional-tree/">KD Tree</a></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
@@ -212,84 +212,84 @@ <h2 id="sorting">Array Sorting Algorithms</h2>
     </tr>
 
     <tr>
-      <td><a href="http://en.wikipedia.org/wiki/Quicksort">Quicksort</a></td>
+      <td><a href="https://www.geeksforgeeks.org/quick-sort/">Quicksort</a></td>
       <td><code class="orange">&Omega;(n log(n))</code></td>
       <td><code class="orange">&Theta;(n log(n))</code></td>
       <td><code class="red">O(n^2)</code></td>
       <td><code class="yellow-green">O(log(n))</code></td>
     </tr>
     <tr>
-      <td><a href="http://en.wikipedia.org/wiki/Merge_sort">Mergesort</a></td>
+      <td><a href="https://www.geeksforgeeks.org/merge-sort/">Mergesort</a></td>
       <td><code class="orange">&Omega;(n log(n))</code></td>
       <td><code class="orange">&Theta;(n log(n))</code></td>
       <td><code class="orange">O(n log(n))</code></td>
       <td><code class="yellow">O(n)</code></td>
     </tr>
     <tr>
-      <td><a href="http://en.wikipedia.org/wiki/Timsort">Timsort</a></td>
+      <td><a href="https://www.geeksforgeeks.org/timsort/">Timsort</a></td>
       <td><code class="yellow">&Omega;(n)</code></td>
       <td><code class="orange">&Theta;(n log(n))</code></td>
       <td><code class="orange">O(n log(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>
+      <td><a href="https://www.geeksforgeeks.org/heap-sort/">Heapsort</a></td>
       <td><code class="orange">&Omega;(n log(n))</code></td>
       <td><code class="orange">&Theta;(n log(n))</code></td>
       <td><code class="orange">O(n log(n))</code></td>
       <td><code class="green">O(1)</code></td>
     </tr>
     <tr>
-      <td><a href="http://en.wikipedia.org/wiki/Bubble_sort">Bubble Sort</a></td>
+      <td><a href="https://www.geeksforgeeks.org/bubble-sort/">Bubble Sort</a></td>
       <td><code class="yellow">&Omega;(n)</code></td>
       <td><code class="red">&Theta;(n^2)</code></td>
       <td><code class="red">O(n^2)</code></td>
       <td><code class="green">O(1)</code></td>
     </tr>
     <tr>
-      <td><a href="http://en.wikipedia.org/wiki/Insertion_sort">Insertion Sort</a></td>
+      <td><a href="https://www.geeksforgeeks.org/insertion-sort/">Insertion Sort</a></td>
       <td><code class="yellow">&Omega;(n)</code></td>
       <td><code class="red">&Theta;(n^2)</code></td>
       <td><code class="red">O(n^2)</code></td>
       <td><code class="green">O(1)</code></td>
     </tr>
     <tr>
-      <td><a href="http://en.wikipedia.org/wiki/Selection_sort">Selection Sort</a></td>
+      <td><a href="https://www.geeksforgeeks.org/selection-sort/">Selection Sort</a></td>
       <td><code class="red">&Omega;(n^2)</code></td>
       <td><code class="red">&Theta;(n^2)</code></td>
       <td><code class="red">O(n^2)</code></td>
       <td><code class="green">O(1)</code></td>
     </tr>
     <tr>
-      <td><a href="https://en.wikipedia.org/wiki/Tree_sort">Tree Sort</a></td>
+      <td><a href="https://www.geeksforgeeks.org/tree-sort/">Tree Sort</a></td>
       <td><code class="orange">&Omega;(n log(n))</code></td>
       <td><code class="orange">&Theta;(n log(n))</code></td>
       <td><code class="red">O(n^2)</code></td>
       <td><code class="yellow">O(n)</code></td>
     </tr>
     <tr>
-      <td><a href="http://en.wikipedia.org/wiki/Shellsort">Shell Sort</a></td>
+      <td><a href="https://www.geeksforgeeks.org/shellsort/">Shell Sort</a></td>
       <td><code class="orange">&Omega;(n log(n))</code></td>
       <td><code class="red">&Theta;(n(log(n))^2)</code></td>
       <td><code class="red">O(n(log(n))^2)</code></td>
       <td><code class="green">O(1)</code></td>
     </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><a rel="tooltip" title="Only for integers. k is a number of buckets" href="https://www.geeksforgeeks.org/bucket-sort-2/">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="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><a rel="tooltip" title="Constant number of digits 'k'" href="https://www.geeksforgeeks.org/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">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><a rel="tooltip" title="Difference between maximum and minimum number 'k'" href="https://www.geeksforgeeks.org/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>