Added data and option for Heap Sort.

Author: polcats

index.html

@@ -32,6 +32,7 @@
                 <select id="algorithms">
                     <option value="bubble">Bubble Sort</option>
                     <option value="comb">Comb Sort</option>
+                    <option value="heap">Heap Sort</option>
                     <option value="insertion">Insertion Sort</option>
                     <option value="selection">Selection Sort</option>
                     <option value="shell">Shell Sort</option>
@@ -68,6 +69,14 @@ <h2 class="algo-header">Comb Sort</h2>
                 </span>
             </div>
 
+            <div id="heap-info" class="algo-container hidden">
+                <h2 class="algo-header">Heap Sort</h2>
+                <span class="algo-details">
+                    Heap sort is a comparison based sorting technique based on Binary Heap data structure. It is similar to selection sort where we
+                    first find the maximum element and place the maximum element at the end. We repeat the same process for remaining element.
+                </span>
+            </div>
+
             <div id="insertion-info" class="algo-container hidden">
                 <h2 class="algo-header">Insertion Sort</h2>
                 <span class="algo-details">